./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-16.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-16.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 4edfcd6a0e29414c9c789482fc7cedb09715c187ed4e164b3ba4e4f923719adc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:12:45,552 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:12:45,613 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 12:12:45,616 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:12:45,617 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:12:45,646 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:12:45,648 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:12:45,649 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:12:45,649 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:12:45,650 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:12:45,650 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:12:45,650 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:12:45,650 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:12:45,651 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:12:45,651 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:12:45,651 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:12:45,652 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:12:45,652 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:12:45,654 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 12:12:45,654 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:12:45,654 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:12:45,655 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:12:45,655 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:12:45,655 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:12:45,655 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:12:45,655 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:12:45,656 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:12:45,656 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:12:45,656 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:12:45,656 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:12:45,656 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:12:45,656 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:12:45,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:12:45,657 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:12:45,657 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:12:45,657 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:12:45,657 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 12:12:45,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 12:12:45,658 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:12:45,658 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:12:45,661 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:12:45,662 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:12:45,662 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 -> 4edfcd6a0e29414c9c789482fc7cedb09715c187ed4e164b3ba4e4f923719adc [2024-11-16 12:12:45,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:12:45,877 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:12:45,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:12:45,880 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:12:45,880 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:12:45,881 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-16.i [2024-11-16 12:12:47,154 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:12:47,317 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:12:47,317 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-16.i [2024-11-16 12:12:47,324 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcfce496f/18d124f4ff514d99a4212cd7fbc4b7a1/FLAG22f1824d4 [2024-11-16 12:12:47,337 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcfce496f/18d124f4ff514d99a4212cd7fbc4b7a1 [2024-11-16 12:12:47,339 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:12:47,340 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:12:47,342 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:12:47,342 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:12:47,347 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:12:47,347 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:12:47" (1/1) ... [2024-11-16 12:12:47,348 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@785d1f8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:47, skipping insertion in model container [2024-11-16 12:12:47,348 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:12:47" (1/1) ... [2024-11-16 12:12:47,370 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:12:47,514 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-16.i[913,926] [2024-11-16 12:12:47,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:12:47,568 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:12:47,578 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-16.i[913,926] [2024-11-16 12:12:47,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:12:47,610 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:12:47,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:47 WrapperNode [2024-11-16 12:12:47,611 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:12:47,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:12:47,612 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:12:47,612 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:12:47,617 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:47" (1/1) ... [2024-11-16 12:12:47,625 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:47" (1/1) ... [2024-11-16 12:12:47,650 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 181 [2024-11-16 12:12:47,650 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:12:47,651 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:12:47,651 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:12:47,651 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:12:47,666 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:47" (1/1) ... [2024-11-16 12:12:47,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:47" (1/1) ... [2024-11-16 12:12:47,669 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:47" (1/1) ... [2024-11-16 12:12:47,685 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 12:12:47,685 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:47" (1/1) ... [2024-11-16 12:12:47,686 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:47" (1/1) ... [2024-11-16 12:12:47,692 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:47" (1/1) ... [2024-11-16 12:12:47,695 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:47" (1/1) ... [2024-11-16 12:12:47,696 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:47" (1/1) ... [2024-11-16 12:12:47,701 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:47" (1/1) ... [2024-11-16 12:12:47,703 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:12:47,707 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:12:47,707 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:12:47,707 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:12:47,708 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:47" (1/1) ... [2024-11-16 12:12:47,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:12:47,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:12:47,758 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 12:12:47,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 12:12:47,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:12:47,821 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:12:47,821 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:12:47,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 12:12:47,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:12:47,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:12:47,901 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:12:47,903 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:12:48,159 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L133: havoc property_#t~bitwise20#1;havoc property_#t~short21#1; [2024-11-16 12:12:48,186 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-16 12:12:48,190 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:12:48,218 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:12:48,222 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:12:48,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:12:48 BoogieIcfgContainer [2024-11-16 12:12:48,223 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:12:48,225 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:12:48,225 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:12:48,229 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:12:48,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:12:47" (1/3) ... [2024-11-16 12:12:48,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48afcb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:12:48, skipping insertion in model container [2024-11-16 12:12:48,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:47" (2/3) ... [2024-11-16 12:12:48,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48afcb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:12:48, skipping insertion in model container [2024-11-16 12:12:48,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:12:48" (3/3) ... [2024-11-16 12:12:48,232 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-16.i [2024-11-16 12:12:48,246 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:12:48,246 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:12:48,292 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:12:48,298 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;@7103acd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:12:48,299 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:12:48,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 55 states have internal predecessors, (75), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 12:12:48,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-16 12:12:48,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:12:48,314 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:12:48,315 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:12:48,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:12:48,319 INFO L85 PathProgramCache]: Analyzing trace with hash 791010201, now seen corresponding path program 1 times [2024-11-16 12:12:48,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:12:48,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296207963] [2024-11-16 12:12:48,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:12:48,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:12:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:48,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:12:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:48,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:12:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:48,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:12:48,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:48,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:12:48,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:48,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:12:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:48,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:12:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:48,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:12:48,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:48,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:12:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:48,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:12:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:48,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:12:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:48,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:12:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:48,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:12:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:48,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:12:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:48,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:12:48,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:48,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:12:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:48,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:12:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:48,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:12:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:48,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:12:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:48,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:12:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:48,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:12:48,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:48,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:12:48,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:48,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 12:12:48,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:48,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 12:12:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:48,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 12:12:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:48,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 12:12:48,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:48,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 12:12:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:48,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 12:12:48,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:12:48,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296207963] [2024-11-16 12:12:48,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296207963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:12:48,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:12:48,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:12:48,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597787731] [2024-11-16 12:12:48,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:12:48,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:12:48,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:12:48,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:12:48,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:12:48,795 INFO L87 Difference]: Start difference. First operand has 83 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 55 states have internal predecessors, (75), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-16 12:12:48,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:12:48,881 INFO L93 Difference]: Finished difference Result 158 states and 273 transitions. [2024-11-16 12:12:48,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:12:48,884 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 167 [2024-11-16 12:12:48,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:12:48,891 INFO L225 Difference]: With dead ends: 158 [2024-11-16 12:12:48,891 INFO L226 Difference]: Without dead ends: 78 [2024-11-16 12:12:48,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:12:48,899 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:12:48,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:12:48,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-16 12:12:48,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-16 12:12:48,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.34) internal successors, (67), 50 states have internal predecessors, (67), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 12:12:48,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 119 transitions. [2024-11-16 12:12:48,937 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 119 transitions. Word has length 167 [2024-11-16 12:12:48,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:12:48,937 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 119 transitions. [2024-11-16 12:12:48,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-16 12:12:48,938 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 119 transitions. [2024-11-16 12:12:48,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-16 12:12:48,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:12:48,940 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:12:48,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 12:12:48,941 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:12:48,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:12:48,941 INFO L85 PathProgramCache]: Analyzing trace with hash -976388491, now seen corresponding path program 1 times [2024-11-16 12:12:48,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:12:48,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474752160] [2024-11-16 12:12:48,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:12:48,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:12:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:49,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:12:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:49,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:12:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:49,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:12:49,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:49,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:12:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:49,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:12:49,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:49,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:12:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:49,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:12:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:49,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:12:49,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:49,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:12:49,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:49,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:12:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:49,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:12:49,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:49,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:12:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:49,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:12:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:49,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:12:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:49,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:12:49,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:49,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:12:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:49,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:12:49,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:49,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:12:49,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:49,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:12:49,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:49,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:12:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:49,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:12:49,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:49,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 12:12:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:49,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 12:12:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:49,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 12:12:49,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:49,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 12:12:49,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:49,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 12:12:49,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:49,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 12:12:49,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:12:49,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474752160] [2024-11-16 12:12:49,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474752160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:12:49,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:12:49,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 12:12:49,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211585502] [2024-11-16 12:12:49,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:12:49,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 12:12:49,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:12:49,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 12:12:49,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-16 12:12:49,896 INFO L87 Difference]: Start difference. First operand 78 states and 119 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:12:50,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:12:50,170 INFO L93 Difference]: Finished difference Result 234 states and 355 transitions. [2024-11-16 12:12:50,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 12:12:50,172 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 167 [2024-11-16 12:12:50,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:12:50,175 INFO L225 Difference]: With dead ends: 234 [2024-11-16 12:12:50,175 INFO L226 Difference]: Without dead ends: 159 [2024-11-16 12:12:50,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-16 12:12:50,177 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 163 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 12:12:50,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 408 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 12:12:50,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-16 12:12:50,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 94. [2024-11-16 12:12:50,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 66 states have internal predecessors, (94), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 12:12:50,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 146 transitions. [2024-11-16 12:12:50,191 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 146 transitions. Word has length 167 [2024-11-16 12:12:50,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:12:50,192 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 146 transitions. [2024-11-16 12:12:50,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:12:50,193 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 146 transitions. [2024-11-16 12:12:50,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-16 12:12:50,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:12:50,195 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:12:50,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 12:12:50,195 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:12:50,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:12:50,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1481947116, now seen corresponding path program 1 times [2024-11-16 12:12:50,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:12:50,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791651582] [2024-11-16 12:12:50,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:12:50,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:12:50,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:50,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:12:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:50,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:12:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:50,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:12:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:50,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:12:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:50,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:12:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:50,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:12:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:50,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:12:50,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:50,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:12:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:50,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:12:50,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:50,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:12:50,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:50,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:12:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:50,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:12:50,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:50,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:12:50,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:50,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:12:50,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:50,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:12:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:50,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:12:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:50,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:12:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:50,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:12:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:50,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:12:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:50,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:12:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:50,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:12:50,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:50,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 12:12:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:50,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 12:12:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:50,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 12:12:50,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:50,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 12:12:50,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:50,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 12:12:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:50,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 12:12:50,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:12:50,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791651582] [2024-11-16 12:12:50,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791651582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:12:50,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:12:50,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 12:12:50,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123453644] [2024-11-16 12:12:50,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:12:50,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 12:12:50,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:12:50,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 12:12:50,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-16 12:12:50,884 INFO L87 Difference]: Start difference. First operand 94 states and 146 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:12:51,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:12:51,151 INFO L93 Difference]: Finished difference Result 250 states and 379 transitions. [2024-11-16 12:12:51,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 12:12:51,151 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 167 [2024-11-16 12:12:51,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:12:51,153 INFO L225 Difference]: With dead ends: 250 [2024-11-16 12:12:51,153 INFO L226 Difference]: Without dead ends: 159 [2024-11-16 12:12:51,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-16 12:12:51,155 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 135 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 12:12:51,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 579 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 12:12:51,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-16 12:12:51,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 106. [2024-11-16 12:12:51,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 78 states have (on average 1.4743589743589745) internal successors, (115), 78 states have internal predecessors, (115), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 12:12:51,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 167 transitions. [2024-11-16 12:12:51,163 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 167 transitions. Word has length 167 [2024-11-16 12:12:51,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:12:51,164 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 167 transitions. [2024-11-16 12:12:51,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:12:51,164 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 167 transitions. [2024-11-16 12:12:51,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-16 12:12:51,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:12:51,165 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:12:51,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 12:12:51,166 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:12:51,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:12:51,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1811026996, now seen corresponding path program 1 times [2024-11-16 12:12:51,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:12:51,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634802860] [2024-11-16 12:12:51,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:12:51,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:12:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:52,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:12:52,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:52,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:12:52,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:52,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:12:52,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:52,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:12:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:52,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:12:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:52,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:12:52,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:52,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:12:52,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:52,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:12:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:52,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:12:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:52,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:12:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:52,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:12:52,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:52,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:12:52,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:52,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:12:52,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:52,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:12:52,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:52,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:12:52,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:52,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:12:52,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:52,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:12:52,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:52,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:12:52,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:52,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:12:52,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:52,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:12:52,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:52,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:12:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:52,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 12:12:52,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:52,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 12:12:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:52,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 12:12:52,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:52,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 12:12:52,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:52,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 12:12:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:52,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 12:12:52,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:12:52,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634802860] [2024-11-16 12:12:52,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634802860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:12:52,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:12:52,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 12:12:52,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140962783] [2024-11-16 12:12:52,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:12:52,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 12:12:52,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:12:52,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 12:12:52,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-16 12:12:52,869 INFO L87 Difference]: Start difference. First operand 106 states and 167 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:12:53,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:12:53,149 INFO L93 Difference]: Finished difference Result 276 states and 425 transitions. [2024-11-16 12:12:53,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 12:12:53,150 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 167 [2024-11-16 12:12:53,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:12:53,151 INFO L225 Difference]: With dead ends: 276 [2024-11-16 12:12:53,151 INFO L226 Difference]: Without dead ends: 173 [2024-11-16 12:12:53,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-16 12:12:53,152 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 134 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 12:12:53,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 549 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 12:12:53,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-16 12:12:53,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 107. [2024-11-16 12:12:53,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 79 states have (on average 1.481012658227848) internal successors, (117), 79 states have internal predecessors, (117), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 12:12:53,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 169 transitions. [2024-11-16 12:12:53,160 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 169 transitions. Word has length 167 [2024-11-16 12:12:53,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:12:53,160 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 169 transitions. [2024-11-16 12:12:53,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:12:53,161 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 169 transitions. [2024-11-16 12:12:53,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-16 12:12:53,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:12:53,162 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:12:53,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 12:12:53,162 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:12:53,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:12:53,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1305468371, now seen corresponding path program 1 times [2024-11-16 12:12:53,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:12:53,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354763719] [2024-11-16 12:12:53,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:12:53,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:12:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:12:54,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:12:54,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:12:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:12:54,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:12:54,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:12:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:12:54,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:12:54,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:12:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:12:54,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:12:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:12:54,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:12:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:12:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:12:54,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:12:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:12:54,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:12:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:12:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:12:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:12:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 12:12:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 12:12:54,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 12:12:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 12:12:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 12:12:54,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 12:12:54,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:12:54,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354763719] [2024-11-16 12:12:54,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354763719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:12:54,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:12:54,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 12:12:54,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438475668] [2024-11-16 12:12:54,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:12:54,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 12:12:54,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:12:54,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 12:12:54,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-16 12:12:54,079 INFO L87 Difference]: Start difference. First operand 107 states and 169 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:12:54,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:12:54,400 INFO L93 Difference]: Finished difference Result 277 states and 424 transitions. [2024-11-16 12:12:54,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 12:12:54,401 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 167 [2024-11-16 12:12:54,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:12:54,402 INFO L225 Difference]: With dead ends: 277 [2024-11-16 12:12:54,402 INFO L226 Difference]: Without dead ends: 173 [2024-11-16 12:12:54,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-16 12:12:54,403 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 104 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 12:12:54,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 713 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 12:12:54,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-16 12:12:54,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 106. [2024-11-16 12:12:54,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 78 states have (on average 1.4743589743589745) internal successors, (115), 78 states have internal predecessors, (115), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 12:12:54,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 167 transitions. [2024-11-16 12:12:54,410 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 167 transitions. Word has length 167 [2024-11-16 12:12:54,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:12:54,411 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 167 transitions. [2024-11-16 12:12:54,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:12:54,411 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 167 transitions. [2024-11-16 12:12:54,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-16 12:12:54,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:12:54,412 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:12:54,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 12:12:54,413 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:12:54,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:12:54,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1529148921, now seen corresponding path program 1 times [2024-11-16 12:12:54,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:12:54,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106154617] [2024-11-16 12:12:54,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:12:54,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:12:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:12:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:12:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:12:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:12:54,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:12:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:12:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:12:54,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:12:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:12:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:12:54,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:12:54,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:12:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:12:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:12:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:12:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:12:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:12:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:12:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:12:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:12:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:12:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 12:12:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 12:12:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 12:12:54,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 12:12:54,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 12:12:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:54,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 12:12:54,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:12:54,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106154617] [2024-11-16 12:12:54,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106154617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:12:54,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:12:54,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 12:12:54,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157491031] [2024-11-16 12:12:54,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:12:54,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 12:12:54,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:12:54,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 12:12:54,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-16 12:12:54,952 INFO L87 Difference]: Start difference. First operand 106 states and 167 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:12:55,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:12:55,323 INFO L93 Difference]: Finished difference Result 304 states and 467 transitions. [2024-11-16 12:12:55,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 12:12:55,326 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168 [2024-11-16 12:12:55,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:12:55,328 INFO L225 Difference]: With dead ends: 304 [2024-11-16 12:12:55,328 INFO L226 Difference]: Without dead ends: 201 [2024-11-16 12:12:55,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-16 12:12:55,330 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 197 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 12:12:55,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 697 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 12:12:55,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-16 12:12:55,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 127. [2024-11-16 12:12:55,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 99 states have (on average 1.5151515151515151) internal successors, (150), 99 states have internal predecessors, (150), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 12:12:55,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 202 transitions. [2024-11-16 12:12:55,344 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 202 transitions. Word has length 168 [2024-11-16 12:12:55,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:12:55,348 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 202 transitions. [2024-11-16 12:12:55,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:12:55,348 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 202 transitions. [2024-11-16 12:12:55,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-16 12:12:55,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:12:55,349 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:12:55,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 12:12:55,350 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:12:55,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:12:55,350 INFO L85 PathProgramCache]: Analyzing trace with hash -2034707546, now seen corresponding path program 1 times [2024-11-16 12:12:55,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:12:55,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825034235] [2024-11-16 12:12:55,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:12:55,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:12:55,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:55,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:12:55,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:55,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:12:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:55,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:12:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:55,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:12:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:55,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:12:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:55,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:12:55,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:55,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:12:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:55,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:12:55,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:55,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:12:55,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:55,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:12:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:55,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:12:55,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:55,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:12:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:55,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:12:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:55,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:12:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:55,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:12:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:55,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:12:55,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:55,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:12:55,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:55,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:12:55,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:55,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:12:55,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:55,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:12:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:55,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:12:55,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:55,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 12:12:55,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:55,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 12:12:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:55,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 12:12:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:55,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 12:12:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:55,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 12:12:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:55,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 12:12:55,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:12:55,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825034235] [2024-11-16 12:12:55,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825034235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:12:55,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:12:55,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 12:12:55,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723980254] [2024-11-16 12:12:55,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:12:55,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 12:12:55,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:12:55,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 12:12:55,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-16 12:12:55,807 INFO L87 Difference]: Start difference. First operand 127 states and 202 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:12:56,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:12:56,131 INFO L93 Difference]: Finished difference Result 325 states and 493 transitions. [2024-11-16 12:12:56,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 12:12:56,132 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168 [2024-11-16 12:12:56,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:12:56,133 INFO L225 Difference]: With dead ends: 325 [2024-11-16 12:12:56,133 INFO L226 Difference]: Without dead ends: 201 [2024-11-16 12:12:56,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-16 12:12:56,134 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 229 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 12:12:56,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 552 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 12:12:56,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-16 12:12:56,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 136. [2024-11-16 12:12:56,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 108 states have (on average 1.5277777777777777) internal successors, (165), 108 states have internal predecessors, (165), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 12:12:56,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 217 transitions. [2024-11-16 12:12:56,144 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 217 transitions. Word has length 168 [2024-11-16 12:12:56,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:12:56,144 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 217 transitions. [2024-11-16 12:12:56,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:12:56,145 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 217 transitions. [2024-11-16 12:12:56,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-16 12:12:56,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:12:56,146 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:12:56,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 12:12:56,146 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:12:56,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:12:56,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1258266566, now seen corresponding path program 1 times [2024-11-16 12:12:56,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:12:56,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381677994] [2024-11-16 12:12:56,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:12:56,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:12:56,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:56,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:12:56,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:56,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:12:56,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:56,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:12:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:56,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:12:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:56,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:12:56,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:56,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:12:56,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:56,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:12:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:56,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:12:56,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:56,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:12:56,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:56,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:12:56,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:56,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:12:56,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:56,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:12:56,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:56,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:12:56,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:56,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:12:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:56,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:12:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:56,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:12:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:56,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:12:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:56,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:12:56,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:56,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:12:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:56,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:12:56,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:56,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:12:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:56,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 12:12:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:56,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 12:12:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:56,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 12:12:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:56,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 12:12:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:56,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 12:12:56,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:56,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 12:12:56,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:12:56,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381677994] [2024-11-16 12:12:56,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381677994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:12:56,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:12:56,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 12:12:56,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421965270] [2024-11-16 12:12:56,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:12:56,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 12:12:56,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:12:56,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 12:12:56,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-16 12:12:56,772 INFO L87 Difference]: Start difference. First operand 136 states and 217 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:12:57,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:12:57,338 INFO L93 Difference]: Finished difference Result 348 states and 531 transitions. [2024-11-16 12:12:57,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 12:12:57,338 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168 [2024-11-16 12:12:57,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:12:57,340 INFO L225 Difference]: With dead ends: 348 [2024-11-16 12:12:57,340 INFO L226 Difference]: Without dead ends: 215 [2024-11-16 12:12:57,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-16 12:12:57,341 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 141 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 12:12:57,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 836 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 12:12:57,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-16 12:12:57,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 136. [2024-11-16 12:12:57,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 108 states have (on average 1.5277777777777777) internal successors, (165), 108 states have internal predecessors, (165), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 12:12:57,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 217 transitions. [2024-11-16 12:12:57,347 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 217 transitions. Word has length 168 [2024-11-16 12:12:57,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:12:57,347 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 217 transitions. [2024-11-16 12:12:57,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:12:57,348 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 217 transitions. [2024-11-16 12:12:57,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-16 12:12:57,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:12:57,349 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:12:57,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 12:12:57,349 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:12:57,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:12:57,350 INFO L85 PathProgramCache]: Analyzing trace with hash 752707941, now seen corresponding path program 1 times [2024-11-16 12:12:57,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:12:57,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335364826] [2024-11-16 12:12:57,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:12:57,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:12:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:12:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:12:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:12:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:12:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:12:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:12:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:12:58,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:12:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:12:58,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:12:58,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:12:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:12:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:12:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:12:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:12:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:12:58,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:12:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:12:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:12:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:12:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:12:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 12:12:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 12:12:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 12:12:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 12:12:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 12:12:58,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 12:12:58,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:12:58,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335364826] [2024-11-16 12:12:58,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335364826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:12:58,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:12:58,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 12:12:58,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556700016] [2024-11-16 12:12:58,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:12:58,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 12:12:58,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:12:58,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 12:12:58,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-16 12:12:58,178 INFO L87 Difference]: Start difference. First operand 136 states and 217 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:12:58,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:12:58,606 INFO L93 Difference]: Finished difference Result 348 states and 528 transitions. [2024-11-16 12:12:58,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 12:12:58,607 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168 [2024-11-16 12:12:58,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:12:58,608 INFO L225 Difference]: With dead ends: 348 [2024-11-16 12:12:58,608 INFO L226 Difference]: Without dead ends: 215 [2024-11-16 12:12:58,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-16 12:12:58,609 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 170 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 12:12:58,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 723 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 12:12:58,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-16 12:12:58,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 126. [2024-11-16 12:12:58,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 98 states have (on average 1.510204081632653) internal successors, (148), 98 states have internal predecessors, (148), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 12:12:58,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 200 transitions. [2024-11-16 12:12:58,614 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 200 transitions. Word has length 168 [2024-11-16 12:12:58,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:12:58,615 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 200 transitions. [2024-11-16 12:12:58,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:12:58,615 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 200 transitions. [2024-11-16 12:12:58,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-16 12:12:58,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:12:58,616 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:12:58,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 12:12:58,617 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:12:58,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:12:58,617 INFO L85 PathProgramCache]: Analyzing trace with hash -2039683098, now seen corresponding path program 1 times [2024-11-16 12:12:58,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:12:58,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078035129] [2024-11-16 12:12:58,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:12:58,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:12:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:12:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:12:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:12:58,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:12:58,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:12:58,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:12:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:12:58,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:12:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:12:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:12:58,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:12:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:12:58,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:12:58,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:12:58,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:12:58,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:12:58,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:12:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:12:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:12:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:12:58,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:12:58,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 12:12:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 12:12:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 12:12:58,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 12:12:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 12:12:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:58,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 12:12:58,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:12:58,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078035129] [2024-11-16 12:12:58,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078035129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:12:58,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:12:58,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 12:12:58,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622528910] [2024-11-16 12:12:58,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:12:58,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 12:12:58,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:12:58,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 12:12:58,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:12:58,695 INFO L87 Difference]: Start difference. First operand 126 states and 200 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:12:58,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:12:58,736 INFO L93 Difference]: Finished difference Result 289 states and 453 transitions. [2024-11-16 12:12:58,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 12:12:58,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168 [2024-11-16 12:12:58,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:12:58,740 INFO L225 Difference]: With dead ends: 289 [2024-11-16 12:12:58,740 INFO L226 Difference]: Without dead ends: 166 [2024-11-16 12:12:58,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:12:58,741 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 45 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:12:58,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 237 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:12:58,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-16 12:12:58,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2024-11-16 12:12:58,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 129 states have (on average 1.4651162790697674) internal successors, (189), 130 states have internal predecessors, (189), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-16 12:12:58,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 249 transitions. [2024-11-16 12:12:58,747 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 249 transitions. Word has length 168 [2024-11-16 12:12:58,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:12:58,748 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 249 transitions. [2024-11-16 12:12:58,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:12:58,748 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 249 transitions. [2024-11-16 12:12:58,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-16 12:12:58,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:12:58,749 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:12:58,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 12:12:58,750 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:12:58,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:12:58,750 INFO L85 PathProgramCache]: Analyzing trace with hash -296872763, now seen corresponding path program 1 times [2024-11-16 12:12:58,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:12:58,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602266993] [2024-11-16 12:12:58,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:12:58,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:12:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:59,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:12:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:59,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:12:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:59,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:12:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:59,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:12:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:59,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:12:59,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:59,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:12:59,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:59,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:12:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:59,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:12:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:59,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:12:59,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:59,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:12:59,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:59,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:12:59,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:59,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:12:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:59,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:12:59,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:59,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:12:59,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:59,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:12:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:59,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:12:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:59,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:12:59,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:59,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:12:59,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:59,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:12:59,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:59,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:12:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:59,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:12:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:59,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 12:12:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:59,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 12:12:59,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:59,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 12:12:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:59,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 12:12:59,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:59,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 12:12:59,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:59,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 12:12:59,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:12:59,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602266993] [2024-11-16 12:12:59,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602266993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:12:59,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:12:59,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 12:12:59,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043333084] [2024-11-16 12:12:59,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:12:59,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 12:12:59,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:12:59,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 12:12:59,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-16 12:12:59,409 INFO L87 Difference]: Start difference. First operand 162 states and 249 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:13:00,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:13:00,096 INFO L93 Difference]: Finished difference Result 509 states and 746 transitions. [2024-11-16 12:13:00,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 12:13:00,096 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168 [2024-11-16 12:13:00,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:13:00,103 INFO L225 Difference]: With dead ends: 509 [2024-11-16 12:13:00,104 INFO L226 Difference]: Without dead ends: 350 [2024-11-16 12:13:00,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-16 12:13:00,105 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 300 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 12:13:00,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 687 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 12:13:00,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-16 12:13:00,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 194. [2024-11-16 12:13:00,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 158 states have (on average 1.4493670886075949) internal successors, (229), 160 states have internal predecessors, (229), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-16 12:13:00,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 293 transitions. [2024-11-16 12:13:00,114 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 293 transitions. Word has length 168 [2024-11-16 12:13:00,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:13:00,116 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 293 transitions. [2024-11-16 12:13:00,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:13:00,116 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 293 transitions. [2024-11-16 12:13:00,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-16 12:13:00,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:13:00,117 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:13:00,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 12:13:00,118 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:13:00,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:13:00,118 INFO L85 PathProgramCache]: Analyzing trace with hash -802431388, now seen corresponding path program 1 times [2024-11-16 12:13:00,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:13:00,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558217723] [2024-11-16 12:13:00,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:13:00,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:13:00,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:00,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:13:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:00,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:13:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:00,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:13:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:00,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:13:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:00,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:13:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:00,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:13:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:00,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:13:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:00,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:13:00,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:00,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:13:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:00,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:13:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:00,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:13:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:00,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:13:00,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:00,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:13:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:00,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:13:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:00,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:13:00,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:00,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:13:00,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:00,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:13:00,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:00,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:13:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:00,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:13:00,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:00,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:13:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:00,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:13:00,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:00,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 12:13:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:00,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 12:13:00,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:00,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 12:13:00,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:00,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 12:13:00,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:00,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 12:13:00,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:00,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 12:13:00,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:13:00,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558217723] [2024-11-16 12:13:00,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558217723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:13:00,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:13:00,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 12:13:00,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19656016] [2024-11-16 12:13:00,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:13:00,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 12:13:00,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:13:00,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 12:13:00,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-16 12:13:00,798 INFO L87 Difference]: Start difference. First operand 194 states and 293 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:13:01,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:13:01,572 INFO L93 Difference]: Finished difference Result 541 states and 787 transitions. [2024-11-16 12:13:01,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 12:13:01,572 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168 [2024-11-16 12:13:01,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:13:01,574 INFO L225 Difference]: With dead ends: 541 [2024-11-16 12:13:01,574 INFO L226 Difference]: Without dead ends: 350 [2024-11-16 12:13:01,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-16 12:13:01,575 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 177 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 12:13:01,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 719 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 12:13:01,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-16 12:13:01,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 206. [2024-11-16 12:13:01,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 170 states have (on average 1.4588235294117646) internal successors, (248), 172 states have internal predecessors, (248), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-16 12:13:01,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 312 transitions. [2024-11-16 12:13:01,590 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 312 transitions. Word has length 168 [2024-11-16 12:13:01,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:13:01,590 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 312 transitions. [2024-11-16 12:13:01,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:13:01,591 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 312 transitions. [2024-11-16 12:13:01,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-16 12:13:01,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:13:01,592 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:13:01,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 12:13:01,592 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:13:01,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:13:01,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1804424572, now seen corresponding path program 1 times [2024-11-16 12:13:01,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:13:01,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075710008] [2024-11-16 12:13:01,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:13:01,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:13:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:03,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:13:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:03,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:13:03,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:03,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:13:03,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:03,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:13:03,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:03,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:13:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:03,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:13:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:03,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:13:03,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:03,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:13:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:03,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:13:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:03,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:13:03,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:03,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:13:03,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:03,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:13:03,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:03,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:13:03,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:03,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:13:03,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:03,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:13:03,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:03,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:13:03,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:03,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:13:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:03,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:13:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:03,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:13:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:03,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:13:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:03,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:13:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:03,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 12:13:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:03,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 12:13:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:03,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 12:13:03,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:03,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 12:13:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:03,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 12:13:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:03,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 12:13:03,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:13:03,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075710008] [2024-11-16 12:13:03,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075710008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:13:03,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:13:03,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 12:13:03,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455091777] [2024-11-16 12:13:03,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:13:03,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 12:13:03,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:13:03,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 12:13:03,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-16 12:13:03,977 INFO L87 Difference]: Start difference. First operand 206 states and 312 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:13:04,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:13:04,709 INFO L93 Difference]: Finished difference Result 554 states and 824 transitions. [2024-11-16 12:13:04,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 12:13:04,713 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168 [2024-11-16 12:13:04,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:13:04,715 INFO L225 Difference]: With dead ends: 554 [2024-11-16 12:13:04,716 INFO L226 Difference]: Without dead ends: 351 [2024-11-16 12:13:04,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-11-16 12:13:04,717 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 142 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 12:13:04,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 409 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 12:13:04,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-16 12:13:04,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 194. [2024-11-16 12:13:04,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 158 states have (on average 1.4430379746835442) internal successors, (228), 160 states have internal predecessors, (228), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-16 12:13:04,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 292 transitions. [2024-11-16 12:13:04,727 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 292 transitions. Word has length 168 [2024-11-16 12:13:04,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:13:04,728 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 292 transitions. [2024-11-16 12:13:04,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:13:04,728 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 292 transitions. [2024-11-16 12:13:04,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-16 12:13:04,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:13:04,729 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:13:04,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 12:13:04,729 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:13:04,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:13:04,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1855046537, now seen corresponding path program 1 times [2024-11-16 12:13:04,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:13:04,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36681971] [2024-11-16 12:13:04,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:13:04,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:13:04,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 12:13:04,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [428417835] [2024-11-16 12:13:04,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:13:04,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:13:04,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:13:04,763 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 12:13:04,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 12:13:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 12:13:04,866 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 12:13:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 12:13:05,022 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 12:13:05,023 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 12:13:05,028 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 12:13:05,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 12:13:05,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-16 12:13:05,232 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:13:05,303 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 12:13:05,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:13:05 BoogieIcfgContainer [2024-11-16 12:13:05,305 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 12:13:05,306 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 12:13:05,306 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 12:13:05,306 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 12:13:05,306 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:12:48" (3/4) ... [2024-11-16 12:13:05,308 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 12:13:05,309 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 12:13:05,309 INFO L158 Benchmark]: Toolchain (without parser) took 17969.06ms. Allocated memory was 142.6MB in the beginning and 595.6MB in the end (delta: 453.0MB). Free memory was 71.4MB in the beginning and 261.4MB in the end (delta: -190.0MB). Peak memory consumption was 265.1MB. Max. memory is 16.1GB. [2024-11-16 12:13:05,310 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 142.6MB. Free memory is still 105.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 12:13:05,310 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.13ms. Allocated memory is still 142.6MB. Free memory was 71.1MB in the beginning and 55.7MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 12:13:05,310 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.79ms. Allocated memory is still 142.6MB. Free memory was 55.7MB in the beginning and 52.8MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 12:13:05,310 INFO L158 Benchmark]: Boogie Preprocessor took 55.76ms. Allocated memory is still 142.6MB. Free memory was 52.5MB in the beginning and 49.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 12:13:05,310 INFO L158 Benchmark]: IcfgBuilder took 515.72ms. Allocated memory was 142.6MB in the beginning and 188.7MB in the end (delta: 46.1MB). Free memory was 49.4MB in the beginning and 136.9MB in the end (delta: -87.5MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2024-11-16 12:13:05,311 INFO L158 Benchmark]: TraceAbstraction took 17080.69ms. Allocated memory was 188.7MB in the beginning and 595.6MB in the end (delta: 406.8MB). Free memory was 135.9MB in the beginning and 262.5MB in the end (delta: -126.6MB). Peak memory consumption was 279.1MB. Max. memory is 16.1GB. [2024-11-16 12:13:05,311 INFO L158 Benchmark]: Witness Printer took 3.49ms. Allocated memory is still 595.6MB. Free memory was 262.5MB in the beginning and 261.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 12:13:05,312 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 142.6MB. Free memory is still 105.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 269.13ms. Allocated memory is still 142.6MB. Free memory was 71.1MB in the beginning and 55.7MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.79ms. Allocated memory is still 142.6MB. Free memory was 55.7MB in the beginning and 52.8MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.76ms. Allocated memory is still 142.6MB. Free memory was 52.5MB in the beginning and 49.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 515.72ms. Allocated memory was 142.6MB in the beginning and 188.7MB in the end (delta: 46.1MB). Free memory was 49.4MB in the beginning and 136.9MB in the end (delta: -87.5MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * TraceAbstraction took 17080.69ms. Allocated memory was 188.7MB in the beginning and 595.6MB in the end (delta: 406.8MB). Free memory was 135.9MB in the beginning and 262.5MB in the end (delta: -126.6MB). Peak memory consumption was 279.1MB. Max. memory is 16.1GB. * Witness Printer took 3.49ms. Allocated memory is still 595.6MB. Free memory was 262.5MB in the beginning and 261.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 133, overapproximation of someBinaryDOUBLEComparisonOperation at line 133, overapproximation of someUnaryFLOAToperation at line 81, overapproximation of someBinaryArithmeticFLOAToperation at line 81. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -50; [L23] signed short int var_1_2 = 10000; [L24] signed long int var_1_3 = 64; [L25] unsigned char var_1_4 = 0; [L26] signed short int var_1_5 = 8; [L27] signed short int var_1_6 = 64; [L28] unsigned short int var_1_7 = 8; [L29] unsigned short int var_1_8 = 256; [L30] signed long int var_1_9 = 2; [L31] signed long int var_1_10 = 1441729073; [L32] unsigned short int var_1_11 = 32; [L33] double var_1_12 = 7.6; [L34] double var_1_13 = 127.8; [L35] signed char var_1_14 = 32; [L36] signed char var_1_15 = 50; [L37] signed char var_1_16 = 0; [L38] signed char var_1_17 = 16; [L39] float var_1_18 = 0.4; [L40] unsigned char var_1_19 = 0; [L41] float var_1_20 = 24.4; [L42] float var_1_21 = 500.5; [L43] float var_1_22 = 99.324; [L44] unsigned short int var_1_23 = 128; VAL [isInitial=0, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=10000, var_1_3=64, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L137] isInitial = 1 [L138] FCALL initially() [L139] COND TRUE 1 [L140] FCALL updateLastVariables() [L141] CALL updateVariables() [L88] var_1_2 = __VERIFIER_nondet_short() [L89] CALL assume_abort_if_not(var_1_2 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=64, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=64, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L89] RET assume_abort_if_not(var_1_2 >= -32768) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=64, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L90] CALL assume_abort_if_not(var_1_2 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=64, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=64, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L90] RET assume_abort_if_not(var_1_2 <= 32767) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=64, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L91] var_1_3 = __VERIFIER_nondet_long() [L92] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L92] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L93] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L93] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L94] var_1_4 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L95] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L96] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L96] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L97] var_1_5 = __VERIFIER_nondet_short() [L98] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L98] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L99] CALL assume_abort_if_not(var_1_5 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L99] RET assume_abort_if_not(var_1_5 <= 32766) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L100] var_1_6 = __VERIFIER_nondet_short() [L101] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=256, var_1_9=2] [L101] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=256, var_1_9=2] [L102] CALL assume_abort_if_not(var_1_6 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=256, var_1_9=2] [L102] RET assume_abort_if_not(var_1_6 <= 32766) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=256, var_1_9=2] [L103] var_1_8 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_9=2] [L104] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_9=2] [L105] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L105] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L106] var_1_10 = __VERIFIER_nondet_long() [L107] CALL assume_abort_if_not(var_1_10 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L107] RET assume_abort_if_not(var_1_10 >= 1073741823) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L108] CALL assume_abort_if_not(var_1_10 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L108] RET assume_abort_if_not(var_1_10 <= 2147483646) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L109] var_1_13 = __VERIFIER_nondet_double() [L110] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L110] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L111] var_1_15 = __VERIFIER_nondet_char() [L112] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L112] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L113] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L113] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L114] var_1_16 = __VERIFIER_nondet_char() [L115] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L115] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L116] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L116] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L117] var_1_17 = __VERIFIER_nondet_char() [L118] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L118] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L119] CALL assume_abort_if_not(var_1_17 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L119] RET assume_abort_if_not(var_1_17 <= 63) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L120] var_1_19 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L121] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L122] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L122] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L123] var_1_20 = __VERIFIER_nondet_float() [L124] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L124] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L125] var_1_21 = __VERIFIER_nondet_float() [L126] CALL assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L126] RET assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_22=24831/250, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L127] var_1_22 = __VERIFIER_nondet_float() [L128] CALL assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L128] RET assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L141] RET updateVariables() [L142] CALL step() [L48] COND FALSE !((var_1_2 / -50) >= var_1_3) [L55] var_1_1 = var_1_5 VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L57] COND FALSE !(var_1_2 < var_1_6) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L60] COND TRUE var_1_6 > 128 [L61] var_1_9 = (var_1_8 - (var_1_10 - var_1_7)) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=-1073709048] [L63] EXPR var_1_5 | var_1_6 VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=-1073709048] [L63] COND FALSE !(((var_1_7 + var_1_9) * var_1_3) < (var_1_5 | var_1_6)) [L68] var_1_11 = var_1_8 VAL [isInitial=1, var_1_10=1073741823, var_1_11=-32769, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=-1073709048] [L70] COND FALSE !(var_1_11 < (- var_1_10)) [L75] var_1_12 = var_1_13 VAL [isInitial=1, var_1_10=1073741823, var_1_11=-32769, var_1_12=2, var_1_13=2, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=-1073709048] [L77] COND TRUE var_1_1 <= var_1_8 [L78] var_1_14 = ((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))) - var_1_17) + -2) VAL [isInitial=1, var_1_10=1073741823, var_1_11=-32769, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=-1073709048] [L80] COND TRUE var_1_4 || var_1_19 [L81] var_1_18 = ((((var_1_20 + (var_1_21 + var_1_22)) < 0 ) ? -(var_1_20 + (var_1_21 + var_1_22)) : (var_1_20 + (var_1_21 + var_1_22)))) VAL [isInitial=1, var_1_10=1073741823, var_1_11=-32769, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=-1073709048] [L83] COND TRUE var_1_4 && (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) > var_1_5) [L84] var_1_23 = var_1_6 VAL [isInitial=1, var_1_10=1073741823, var_1_11=-32769, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=129, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=-1073709048] [L142] RET step() [L143] CALL, EXPR property() [L133] EXPR (((((var_1_2 / -50) >= var_1_3) ? (var_1_4 ? (var_1_1 == ((signed short int) (var_1_5 - var_1_6))) : (var_1_1 == ((signed short int) var_1_5))) : (var_1_1 == ((signed short int) var_1_5))) && ((var_1_2 < var_1_6) ? (var_1_7 == ((unsigned short int) (var_1_6 + var_1_8))) : 1)) && ((var_1_6 > 128) ? (var_1_9 == ((signed long int) (var_1_8 - (var_1_10 - var_1_7)))) : 1)) && ((((var_1_7 + var_1_9) * var_1_3) < (var_1_5 | var_1_6)) ? (var_1_4 ? (var_1_11 == ((unsigned short int) var_1_8)) : 1) : (var_1_11 == ((unsigned short int) var_1_8))) VAL [isInitial=1, var_1_10=1073741823, var_1_11=-32769, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=129, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=-1073709048] [L133] EXPR var_1_5 | var_1_6 VAL [isInitial=1, var_1_10=1073741823, var_1_11=-32769, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=129, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=-1073709048] [L133] EXPR (((((var_1_2 / -50) >= var_1_3) ? (var_1_4 ? (var_1_1 == ((signed short int) (var_1_5 - var_1_6))) : (var_1_1 == ((signed short int) var_1_5))) : (var_1_1 == ((signed short int) var_1_5))) && ((var_1_2 < var_1_6) ? (var_1_7 == ((unsigned short int) (var_1_6 + var_1_8))) : 1)) && ((var_1_6 > 128) ? (var_1_9 == ((signed long int) (var_1_8 - (var_1_10 - var_1_7)))) : 1)) && ((((var_1_7 + var_1_9) * var_1_3) < (var_1_5 | var_1_6)) ? (var_1_4 ? (var_1_11 == ((unsigned short int) var_1_8)) : 1) : (var_1_11 == ((unsigned short int) var_1_8))) VAL [isInitial=1, var_1_10=1073741823, var_1_11=-32769, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=129, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=-1073709048] [L133-L134] return (((((((((var_1_2 / -50) >= var_1_3) ? (var_1_4 ? (var_1_1 == ((signed short int) (var_1_5 - var_1_6))) : (var_1_1 == ((signed short int) var_1_5))) : (var_1_1 == ((signed short int) var_1_5))) && ((var_1_2 < var_1_6) ? (var_1_7 == ((unsigned short int) (var_1_6 + var_1_8))) : 1)) && ((var_1_6 > 128) ? (var_1_9 == ((signed long int) (var_1_8 - (var_1_10 - var_1_7)))) : 1)) && ((((var_1_7 + var_1_9) * var_1_3) < (var_1_5 | var_1_6)) ? (var_1_4 ? (var_1_11 == ((unsigned short int) var_1_8)) : 1) : (var_1_11 == ((unsigned short int) var_1_8)))) && ((var_1_11 < (- var_1_10)) ? ((var_1_8 <= var_1_2) ? (var_1_12 == ((double) (var_1_13 - 63.75))) : 1) : (var_1_12 == ((double) var_1_13)))) && ((var_1_1 <= var_1_8) ? (var_1_14 == ((signed char) ((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))) - var_1_17) + -2))) : 1)) && ((var_1_4 || var_1_19) ? (var_1_18 == ((float) ((((var_1_20 + (var_1_21 + var_1_22)) < 0 ) ? -(var_1_20 + (var_1_21 + var_1_22)) : (var_1_20 + (var_1_21 + var_1_22)))))) : 1)) && ((var_1_4 && (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) > var_1_5)) ? (var_1_23 == ((unsigned short int) var_1_6)) : 1) ; [L143] RET, EXPR property() [L143] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1073741823, var_1_11=-32769, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=129, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=-1073709048] [L19] reach_error() VAL [isInitial=1, var_1_10=1073741823, var_1_11=-32769, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=129, var_1_2=129, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=-1073709048] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 83 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.0s, OverallIterations: 14, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1937 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1937 mSDsluCounter, 7226 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5520 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4374 IncrementalHoareTripleChecker+Invalid, 4402 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 1706 mSDtfsCounter, 4374 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 841 GetRequests, 749 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=206occurred in iteration=12, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 1019 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 2517 NumberOfCodeBlocks, 2517 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2166 ConstructedInterpolants, 0 QuantifiedInterpolants, 11471 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 16900/16900 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 12:13:05,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-16.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 4edfcd6a0e29414c9c789482fc7cedb09715c187ed4e164b3ba4e4f923719adc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:13:07,416 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:13:07,512 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 12:13:07,520 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:13:07,521 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:13:07,543 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:13:07,547 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:13:07,547 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:13:07,548 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:13:07,548 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:13:07,549 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:13:07,549 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:13:07,550 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:13:07,552 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:13:07,552 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:13:07,552 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:13:07,553 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:13:07,553 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:13:07,553 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:13:07,553 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:13:07,553 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:13:07,557 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:13:07,558 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:13:07,558 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 12:13:07,558 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 12:13:07,559 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:13:07,559 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 12:13:07,559 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:13:07,559 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:13:07,560 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:13:07,560 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:13:07,561 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:13:07,561 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:13:07,561 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:13:07,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:13:07,562 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:13:07,562 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:13:07,562 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:13:07,562 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 12:13:07,563 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 12:13:07,563 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:13:07,563 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:13:07,563 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:13:07,563 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:13:07,563 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 -> 4edfcd6a0e29414c9c789482fc7cedb09715c187ed4e164b3ba4e4f923719adc [2024-11-16 12:13:07,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:13:07,890 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:13:07,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:13:07,893 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:13:07,895 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:13:07,896 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-16.i [2024-11-16 12:13:09,350 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:13:09,527 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:13:09,527 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-16.i [2024-11-16 12:13:09,535 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd148753a/5d841961f1934712b566bf53a98b533e/FLAGb4d289988 [2024-11-16 12:13:09,548 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd148753a/5d841961f1934712b566bf53a98b533e [2024-11-16 12:13:09,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:13:09,552 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:13:09,556 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:13:09,556 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:13:09,564 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:13:09,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:13:09" (1/1) ... [2024-11-16 12:13:09,566 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68e3aa63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:09, skipping insertion in model container [2024-11-16 12:13:09,566 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:13:09" (1/1) ... [2024-11-16 12:13:09,591 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:13:09,770 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-16.i[913,926] [2024-11-16 12:13:09,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:13:09,857 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:13:09,866 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-16.i[913,926] [2024-11-16 12:13:09,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:13:09,923 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:13:09,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:09 WrapperNode [2024-11-16 12:13:09,923 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:13:09,924 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:13:09,924 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:13:09,924 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:13:09,930 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:09" (1/1) ... [2024-11-16 12:13:09,941 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:09" (1/1) ... [2024-11-16 12:13:09,974 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 150 [2024-11-16 12:13:09,978 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:13:09,979 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:13:09,979 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:13:09,979 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:13:09,993 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:09" (1/1) ... [2024-11-16 12:13:09,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:09" (1/1) ... [2024-11-16 12:13:09,996 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:09" (1/1) ... [2024-11-16 12:13:10,013 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 12:13:10,017 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:09" (1/1) ... [2024-11-16 12:13:10,017 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:09" (1/1) ... [2024-11-16 12:13:10,027 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:09" (1/1) ... [2024-11-16 12:13:10,028 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:09" (1/1) ... [2024-11-16 12:13:10,034 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:09" (1/1) ... [2024-11-16 12:13:10,036 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:09" (1/1) ... [2024-11-16 12:13:10,042 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:13:10,043 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:13:10,043 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:13:10,043 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:13:10,044 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:09" (1/1) ... [2024-11-16 12:13:10,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:13:10,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:13:10,070 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 12:13:10,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 12:13:10,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:13:10,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 12:13:10,110 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:13:10,110 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:13:10,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:13:10,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:13:10,189 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:13:10,191 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:13:11,472 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-16 12:13:11,472 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:13:11,484 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:13:11,484 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:13:11,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:13:11 BoogieIcfgContainer [2024-11-16 12:13:11,485 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:13:11,487 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:13:11,488 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:13:11,490 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:13:11,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:13:09" (1/3) ... [2024-11-16 12:13:11,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72934ad4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:13:11, skipping insertion in model container [2024-11-16 12:13:11,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:09" (2/3) ... [2024-11-16 12:13:11,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72934ad4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:13:11, skipping insertion in model container [2024-11-16 12:13:11,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:13:11" (3/3) ... [2024-11-16 12:13:11,493 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-16.i [2024-11-16 12:13:11,507 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:13:11,507 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:13:11,562 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:13:11,567 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;@e2abfb2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:13:11,567 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:13:11,570 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 12:13:11,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-16 12:13:11,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:13:11,582 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:13:11,583 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:13:11,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:13:11,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1548420497, now seen corresponding path program 1 times [2024-11-16 12:13:11,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:13:11,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1747720423] [2024-11-16 12:13:11,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:13:11,598 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:13:11,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:13:11,601 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 12:13:11,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 12:13:11,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:11,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 12:13:11,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:13:12,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2024-11-16 12:13:12,046 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 12:13:12,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:13:12,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1747720423] [2024-11-16 12:13:12,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1747720423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:13:12,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:13:12,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:13:12,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443884552] [2024-11-16 12:13:12,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:13:12,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:13:12,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:13:12,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:13:12,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:13:12,085 INFO L87 Difference]: Start difference. First operand has 74 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-16 12:13:12,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:13:12,106 INFO L93 Difference]: Finished difference Result 140 states and 245 transitions. [2024-11-16 12:13:12,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:13:12,108 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 164 [2024-11-16 12:13:12,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:13:12,114 INFO L225 Difference]: With dead ends: 140 [2024-11-16 12:13:12,114 INFO L226 Difference]: Without dead ends: 69 [2024-11-16 12:13:12,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:13:12,119 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:13:12,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:13:12,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-16 12:13:12,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-16 12:13:12,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 12:13:12,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 105 transitions. [2024-11-16 12:13:12,167 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 105 transitions. Word has length 164 [2024-11-16 12:13:12,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:13:12,167 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 105 transitions. [2024-11-16 12:13:12,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-16 12:13:12,168 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 105 transitions. [2024-11-16 12:13:12,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-16 12:13:12,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:13:12,170 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:13:12,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 12:13:12,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:13:12,371 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:13:12,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:13:12,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1695174603, now seen corresponding path program 1 times [2024-11-16 12:13:12,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:13:12,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690846880] [2024-11-16 12:13:12,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:13:12,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-11-16 12:13:12,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:13:12,378 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 12:13:12,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 12:13:12,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:13:12,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-16 12:13:12,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:13:47,719 WARN L286 SmtUtils]: Spent 7.51s on a formula simplification that was a NOOP. DAG size: 111 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-16 12:14:17,495 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 113 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)