./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-21.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_fillercode_fillercodestructure_filler-ps-ci_file-21.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 970538dd9083d93a461fb14f2c7c5ecaf35f3c2afcba98b5255f20442a223b33 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 14:52:33,485 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 14:52:33,526 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 14:52:33,530 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 14:52:33,530 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 14:52:33,560 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 14:52:33,562 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 14:52:33,562 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 14:52:33,573 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 14:52:33,574 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 14:52:33,574 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 14:52:33,575 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 14:52:33,575 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 14:52:33,575 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 14:52:33,576 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 14:52:33,576 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 14:52:33,576 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 14:52:33,576 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 14:52:33,577 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 14:52:33,577 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 14:52:33,580 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 14:52:33,582 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 14:52:33,582 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 14:52:33,582 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 14:52:33,584 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 14:52:33,584 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 14:52:33,584 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 14:52:33,584 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 14:52:33,585 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 14:52:33,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 14:52:33,585 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 14:52:33,585 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 14:52:33,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:52:33,585 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 14:52:33,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 14:52:33,585 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 14:52:33,586 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 14:52:33,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 14:52:33,586 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 14:52:33,586 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 14:52:33,586 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 14:52:33,587 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 14:52:33,587 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 -> 970538dd9083d93a461fb14f2c7c5ecaf35f3c2afcba98b5255f20442a223b33 [2024-11-16 14:52:33,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 14:52:33,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 14:52:33,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 14:52:33,787 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 14:52:33,787 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 14:52:33,788 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-21.i [2024-11-16 14:52:35,169 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 14:52:35,391 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 14:52:35,391 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-21.i [2024-11-16 14:52:35,398 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1a77d093/fe0f06cd26b04726978652c3a802ce76/FLAG56d9dace4 [2024-11-16 14:52:35,416 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1a77d093/fe0f06cd26b04726978652c3a802ce76 [2024-11-16 14:52:35,418 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 14:52:35,420 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 14:52:35,422 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 14:52:35,422 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 14:52:35,426 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 14:52:35,427 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:52:35" (1/1) ... [2024-11-16 14:52:35,427 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@849d8a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:52:35, skipping insertion in model container [2024-11-16 14:52:35,428 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:52:35" (1/1) ... [2024-11-16 14:52:35,453 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 14:52:35,581 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_fillercode_fillercodestructure_filler-ps-ci_file-21.i[919,932] [2024-11-16 14:52:35,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:52:35,654 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 14:52:35,664 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_fillercode_fillercodestructure_filler-ps-ci_file-21.i[919,932] [2024-11-16 14:52:35,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:52:35,759 INFO L204 MainTranslator]: Completed translation [2024-11-16 14:52:35,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:52:35 WrapperNode [2024-11-16 14:52:35,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 14:52:35,761 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 14:52:35,761 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 14:52:35,761 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 14:52:35,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:52:35" (1/1) ... [2024-11-16 14:52:35,783 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:52:35" (1/1) ... [2024-11-16 14:52:35,825 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 266 [2024-11-16 14:52:35,825 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 14:52:35,826 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 14:52:35,826 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 14:52:35,826 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 14:52:35,836 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:52:35" (1/1) ... [2024-11-16 14:52:35,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:52:35" (1/1) ... [2024-11-16 14:52:35,840 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:52:35" (1/1) ... [2024-11-16 14:52:35,855 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 14:52:35,855 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:52:35" (1/1) ... [2024-11-16 14:52:35,855 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:52:35" (1/1) ... [2024-11-16 14:52:35,865 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:52:35" (1/1) ... [2024-11-16 14:52:35,866 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:52:35" (1/1) ... [2024-11-16 14:52:35,869 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:52:35" (1/1) ... [2024-11-16 14:52:35,871 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:52:35" (1/1) ... [2024-11-16 14:52:35,876 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 14:52:35,877 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 14:52:35,877 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 14:52:35,877 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 14:52:35,877 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:52:35" (1/1) ... [2024-11-16 14:52:35,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:52:35,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:52:35,924 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 14:52:35,933 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 14:52:35,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 14:52:35,964 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 14:52:35,964 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 14:52:35,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 14:52:35,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 14:52:35,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 14:52:36,039 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 14:52:36,040 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 14:52:36,410 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L183: havoc property_#t~ite27#1;havoc property_#t~bitwise26#1;havoc property_#t~short28#1; [2024-11-16 14:52:36,440 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-16 14:52:36,441 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 14:52:36,469 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 14:52:36,469 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 14:52:36,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:52:36 BoogieIcfgContainer [2024-11-16 14:52:36,471 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 14:52:36,473 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 14:52:36,473 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 14:52:36,477 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 14:52:36,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 02:52:35" (1/3) ... [2024-11-16 14:52:36,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f01b12a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:52:36, skipping insertion in model container [2024-11-16 14:52:36,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:52:35" (2/3) ... [2024-11-16 14:52:36,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f01b12a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:52:36, skipping insertion in model container [2024-11-16 14:52:36,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:52:36" (3/3) ... [2024-11-16 14:52:36,481 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-21.i [2024-11-16 14:52:36,496 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 14:52:36,497 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 14:52:36,563 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 14:52:36,569 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;@30275bee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 14:52:36,570 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 14:52:36,573 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 82 states have (on average 1.451219512195122) internal successors, (119), 83 states have internal predecessors, (119), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 14:52:36,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-16 14:52:36,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:52:36,588 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:52:36,588 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:52:36,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:52:36,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1726746009, now seen corresponding path program 1 times [2024-11-16 14:52:36,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:52:36,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545378785] [2024-11-16 14:52:36,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:52:36,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:52:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:36,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:52:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:36,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:52:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:36,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:52:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:36,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:52:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:36,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:52:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:36,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:52:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:36,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 14:52:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:36,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:52:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:36,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:52:36,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:36,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:52:36,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:36,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 14:52:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:36,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 14:52:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:36,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 14:52:36,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:36,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 14:52:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:36,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 14:52:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:36,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 14:52:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:36,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 14:52:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:36,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 14:52:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:36,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 14:52:36,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:36,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:52:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:36,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:52:36,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:36,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:52:36,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:36,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:52:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:36,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 14:52:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:36,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 14:52:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:36,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 14:52:36,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:36,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 14:52:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:36,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 14:52:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:36,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 14:52:36,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:52:36,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545378785] [2024-11-16 14:52:36,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545378785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:52:36,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:52:36,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 14:52:36,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762951968] [2024-11-16 14:52:36,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:52:36,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 14:52:36,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:52:37,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 14:52:37,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 14:52:37,017 INFO L87 Difference]: Start difference. First operand has 113 states, 82 states have (on average 1.451219512195122) internal successors, (119), 83 states have internal predecessors, (119), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 14:52:37,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:52:37,074 INFO L93 Difference]: Finished difference Result 218 states and 371 transitions. [2024-11-16 14:52:37,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 14:52:37,077 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 187 [2024-11-16 14:52:37,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:52:37,085 INFO L225 Difference]: With dead ends: 218 [2024-11-16 14:52:37,086 INFO L226 Difference]: Without dead ends: 108 [2024-11-16 14:52:37,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 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 14:52:37,095 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 14:52:37,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 14:52:37,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-16 14:52:37,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-16 14:52:37,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 78 states have (on average 1.4230769230769231) internal successors, (111), 78 states have internal predecessors, (111), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 14:52:37,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 167 transitions. [2024-11-16 14:52:37,135 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 167 transitions. Word has length 187 [2024-11-16 14:52:37,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:52:37,136 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 167 transitions. [2024-11-16 14:52:37,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 14:52:37,136 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 167 transitions. [2024-11-16 14:52:37,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-16 14:52:37,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:52:37,141 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:52:37,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 14:52:37,141 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:52:37,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:52:37,142 INFO L85 PathProgramCache]: Analyzing trace with hash -279722653, now seen corresponding path program 1 times [2024-11-16 14:52:37,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:52:37,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326062517] [2024-11-16 14:52:37,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:52:37,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:52:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:37,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:52:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:37,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:52:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:37,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:52:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:37,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:52:37,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:37,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:52:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:37,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:52:37,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:37,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 14:52:37,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:37,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:52:37,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:37,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:52:37,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:37,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:52:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:37,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 14:52:37,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:37,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 14:52:37,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:37,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 14:52:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:37,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 14:52:37,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:37,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 14:52:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:37,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 14:52:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:37,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 14:52:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:37,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 14:52:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:37,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 14:52:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:37,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:52:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:37,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:52:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:37,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:52:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:37,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:52:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:37,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 14:52:37,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:37,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 14:52:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:37,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 14:52:37,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:37,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 14:52:37,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:37,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 14:52:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:37,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 14:52:37,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:52:37,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326062517] [2024-11-16 14:52:37,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326062517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:52:37,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:52:37,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 14:52:37,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484416721] [2024-11-16 14:52:37,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:52:37,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 14:52:37,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:52:37,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 14:52:37,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 14:52:37,781 INFO L87 Difference]: Start difference. First operand 108 states and 167 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 14:52:37,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:52:37,884 INFO L93 Difference]: Finished difference Result 304 states and 478 transitions. [2024-11-16 14:52:37,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 14:52:37,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 187 [2024-11-16 14:52:37,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:52:37,889 INFO L225 Difference]: With dead ends: 304 [2024-11-16 14:52:37,889 INFO L226 Difference]: Without dead ends: 199 [2024-11-16 14:52:37,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 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 14:52:37,893 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 90 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 14:52:37,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 303 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 14:52:37,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-16 14:52:37,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 181. [2024-11-16 14:52:37,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 122 states have (on average 1.401639344262295) internal successors, (171), 122 states have internal predecessors, (171), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-16 14:52:37,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 283 transitions. [2024-11-16 14:52:37,933 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 283 transitions. Word has length 187 [2024-11-16 14:52:37,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:52:37,933 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 283 transitions. [2024-11-16 14:52:37,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 14:52:37,934 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 283 transitions. [2024-11-16 14:52:37,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-16 14:52:37,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:52:37,940 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:52:37,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 14:52:37,940 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:52:37,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:52:37,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1441836427, now seen corresponding path program 1 times [2024-11-16 14:52:37,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:52:37,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337702045] [2024-11-16 14:52:37,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:52:37,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:52:37,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:52:38,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:52:38,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:52:38,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:52:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:52:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:52:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 14:52:38,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:52:38,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:52:38,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:52:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 14:52:38,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 14:52:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 14:52:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 14:52:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 14:52:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 14:52:38,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 14:52:38,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 14:52:38,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 14:52:38,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:52:38,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:52:38,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:52:38,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:52:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 14:52:38,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 14:52:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 14:52:38,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 14:52:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 14:52:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 14:52:38,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:52:38,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337702045] [2024-11-16 14:52:38,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337702045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:52:38,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:52:38,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 14:52:38,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46311165] [2024-11-16 14:52:38,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:52:38,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 14:52:38,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:52:38,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 14:52:38,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 14:52:38,332 INFO L87 Difference]: Start difference. First operand 181 states and 283 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 14:52:38,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:52:38,436 INFO L93 Difference]: Finished difference Result 305 states and 479 transitions. [2024-11-16 14:52:38,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 14:52:38,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 188 [2024-11-16 14:52:38,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:52:38,439 INFO L225 Difference]: With dead ends: 305 [2024-11-16 14:52:38,439 INFO L226 Difference]: Without dead ends: 200 [2024-11-16 14:52:38,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 14:52:38,445 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 90 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 14:52:38,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 453 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 14:52:38,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-16 14:52:38,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 183. [2024-11-16 14:52:38,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 124 states have (on average 1.403225806451613) internal successors, (174), 124 states have internal predecessors, (174), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-16 14:52:38,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 286 transitions. [2024-11-16 14:52:38,480 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 286 transitions. Word has length 188 [2024-11-16 14:52:38,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:52:38,481 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 286 transitions. [2024-11-16 14:52:38,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 14:52:38,482 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 286 transitions. [2024-11-16 14:52:38,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-16 14:52:38,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:52:38,486 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:52:38,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 14:52:38,487 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:52:38,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:52:38,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1227939286, now seen corresponding path program 1 times [2024-11-16 14:52:38,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:52:38,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095831373] [2024-11-16 14:52:38,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:52:38,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:52:38,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:52:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:52:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:52:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:52:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:52:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:52:38,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 14:52:38,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:52:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:52:38,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:52:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 14:52:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 14:52:38,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 14:52:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 14:52:38,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 14:52:38,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 14:52:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 14:52:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 14:52:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 14:52:38,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:52:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:52:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:52:38,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:52:38,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 14:52:38,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 14:52:38,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 14:52:38,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 14:52:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 14:52:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:38,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 14:52:38,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:52:38,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095831373] [2024-11-16 14:52:38,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095831373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:52:38,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:52:38,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 14:52:38,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122776632] [2024-11-16 14:52:38,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:52:38,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 14:52:38,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:52:38,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 14:52:38,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 14:52:38,794 INFO L87 Difference]: Start difference. First operand 183 states and 286 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 14:52:38,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:52:38,914 INFO L93 Difference]: Finished difference Result 390 states and 595 transitions. [2024-11-16 14:52:38,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 14:52:38,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 189 [2024-11-16 14:52:38,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:52:38,922 INFO L225 Difference]: With dead ends: 390 [2024-11-16 14:52:38,922 INFO L226 Difference]: Without dead ends: 285 [2024-11-16 14:52:38,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 14:52:38,924 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 138 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 14:52:38,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 447 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 14:52:38,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-16 14:52:38,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 242. [2024-11-16 14:52:38,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 168 states have (on average 1.3869047619047619) internal successors, (233), 169 states have internal predecessors, (233), 70 states have call successors, (70), 3 states have call predecessors, (70), 3 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-16 14:52:38,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 373 transitions. [2024-11-16 14:52:38,966 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 373 transitions. Word has length 189 [2024-11-16 14:52:38,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:52:38,967 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 373 transitions. [2024-11-16 14:52:38,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 14:52:38,967 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 373 transitions. [2024-11-16 14:52:38,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-16 14:52:38,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:52:38,968 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:52:38,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 14:52:38,969 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:52:38,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:52:38,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1424452791, now seen corresponding path program 1 times [2024-11-16 14:52:38,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:52:38,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088164045] [2024-11-16 14:52:38,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:52:38,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:52:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:39,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:52:39,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:39,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:52:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:39,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:52:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:39,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:52:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:39,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:52:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:39,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:52:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:39,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 14:52:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:39,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:52:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:39,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:52:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:39,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:52:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:39,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 14:52:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:39,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 14:52:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:39,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 14:52:39,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:39,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 14:52:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:39,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 14:52:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:39,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 14:52:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:39,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 14:52:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:39,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 14:52:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:39,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 14:52:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:39,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:52:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:39,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:52:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:39,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:52:39,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:39,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:52:39,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:39,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 14:52:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:39,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 14:52:39,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:39,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 14:52:39,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:39,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 14:52:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:39,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 14:52:39,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:39,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 14:52:39,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:52:39,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088164045] [2024-11-16 14:52:39,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088164045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:52:39,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:52:39,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 14:52:39,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906418024] [2024-11-16 14:52:39,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:52:39,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 14:52:39,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:52:39,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 14:52:39,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 14:52:39,884 INFO L87 Difference]: Start difference. First operand 242 states and 373 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 14:52:40,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:52:40,285 INFO L93 Difference]: Finished difference Result 560 states and 832 transitions. [2024-11-16 14:52:40,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 14:52:40,286 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 189 [2024-11-16 14:52:40,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:52:40,289 INFO L225 Difference]: With dead ends: 560 [2024-11-16 14:52:40,289 INFO L226 Difference]: Without dead ends: 396 [2024-11-16 14:52:40,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-16 14:52:40,290 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 85 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 14:52:40,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 679 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 14:52:40,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-16 14:52:40,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 363. [2024-11-16 14:52:40,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 269 states have (on average 1.3717472118959109) internal successors, (369), 272 states have internal predecessors, (369), 86 states have call successors, (86), 7 states have call predecessors, (86), 7 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-16 14:52:40,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 541 transitions. [2024-11-16 14:52:40,314 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 541 transitions. Word has length 189 [2024-11-16 14:52:40,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:52:40,315 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 541 transitions. [2024-11-16 14:52:40,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 14:52:40,315 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 541 transitions. [2024-11-16 14:52:40,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-16 14:52:40,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:52:40,317 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:52:40,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 14:52:40,317 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:52:40,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:52:40,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1717855798, now seen corresponding path program 1 times [2024-11-16 14:52:40,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:52:40,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151206734] [2024-11-16 14:52:40,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:52:40,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:52:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:52:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:52:40,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:52:40,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:52:40,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:52:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:52:40,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 14:52:40,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:52:40,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:52:40,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:52:40,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 14:52:40,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 14:52:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 14:52:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 14:52:40,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 14:52:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 14:52:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 14:52:40,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 14:52:40,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 14:52:40,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:52:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:52:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:52:40,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:52:40,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 14:52:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 14:52:40,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 14:52:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 14:52:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 14:52:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 14:52:40,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:52:40,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151206734] [2024-11-16 14:52:40,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151206734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:52:40,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:52:40,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 14:52:40,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014863873] [2024-11-16 14:52:40,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:52:40,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 14:52:40,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:52:40,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 14:52:40,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 14:52:40,413 INFO L87 Difference]: Start difference. First operand 363 states and 541 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 14:52:40,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:52:40,461 INFO L93 Difference]: Finished difference Result 621 states and 918 transitions. [2024-11-16 14:52:40,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 14:52:40,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 189 [2024-11-16 14:52:40,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:52:40,465 INFO L225 Difference]: With dead ends: 621 [2024-11-16 14:52:40,465 INFO L226 Difference]: Without dead ends: 336 [2024-11-16 14:52:40,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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 14:52:40,466 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 14:52:40,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 315 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 14:52:40,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-11-16 14:52:40,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2024-11-16 14:52:40,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 242 states have (on average 1.334710743801653) internal successors, (323), 245 states have internal predecessors, (323), 86 states have call successors, (86), 7 states have call predecessors, (86), 7 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-16 14:52:40,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 495 transitions. [2024-11-16 14:52:40,497 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 495 transitions. Word has length 189 [2024-11-16 14:52:40,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:52:40,498 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 495 transitions. [2024-11-16 14:52:40,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 14:52:40,498 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 495 transitions. [2024-11-16 14:52:40,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-16 14:52:40,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:52:40,500 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:52:40,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 14:52:40,500 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:52:40,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:52:40,501 INFO L85 PathProgramCache]: Analyzing trace with hash 83099018, now seen corresponding path program 1 times [2024-11-16 14:52:40,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:52:40,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880787121] [2024-11-16 14:52:40,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:52:40,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:52:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:52:40,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:52:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:52:40,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:52:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:52:40,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:52:40,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 14:52:40,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:52:40,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:52:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:52:40,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 14:52:40,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 14:52:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 14:52:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 14:52:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 14:52:40,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 14:52:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 14:52:40,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 14:52:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 14:52:40,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:52:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:52:40,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:52:40,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:52:40,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 14:52:40,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 14:52:40,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 14:52:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 14:52:40,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 14:52:40,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 14:52:40,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:52:40,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880787121] [2024-11-16 14:52:40,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880787121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:52:40,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:52:40,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 14:52:40,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401693162] [2024-11-16 14:52:40,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:52:40,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 14:52:40,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:52:40,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 14:52:40,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 14:52:40,607 INFO L87 Difference]: Start difference. First operand 336 states and 495 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 14:52:40,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:52:40,643 INFO L93 Difference]: Finished difference Result 516 states and 753 transitions. [2024-11-16 14:52:40,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 14:52:40,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 189 [2024-11-16 14:52:40,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:52:40,645 INFO L225 Difference]: With dead ends: 516 [2024-11-16 14:52:40,645 INFO L226 Difference]: Without dead ends: 258 [2024-11-16 14:52:40,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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 14:52:40,646 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 14:52:40,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 306 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 14:52:40,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-16 14:52:40,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2024-11-16 14:52:40,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 180 states have (on average 1.3222222222222222) internal successors, (238), 181 states have internal predecessors, (238), 70 states have call successors, (70), 7 states have call predecessors, (70), 7 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-16 14:52:40,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 378 transitions. [2024-11-16 14:52:40,666 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 378 transitions. Word has length 189 [2024-11-16 14:52:40,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:52:40,666 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 378 transitions. [2024-11-16 14:52:40,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 14:52:40,666 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 378 transitions. [2024-11-16 14:52:40,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-16 14:52:40,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:52:40,668 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:52:40,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 14:52:40,668 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:52:40,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:52:40,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1489409168, now seen corresponding path program 1 times [2024-11-16 14:52:40,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:52:40,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779953584] [2024-11-16 14:52:40,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:52:40,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:52:40,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:52:40,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:52:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:52:40,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:52:40,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:52:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:52:40,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 14:52:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:52:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:52:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:52:40,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 14:52:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 14:52:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 14:52:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 14:52:40,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 14:52:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 14:52:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 14:52:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 14:52:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 14:52:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:52:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:52:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:52:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:52:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 14:52:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 14:52:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 14:52:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 14:52:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 14:52:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 18 proven. 63 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-16 14:52:40,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:52:40,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779953584] [2024-11-16 14:52:40,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779953584] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 14:52:40,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419105882] [2024-11-16 14:52:40,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:52:40,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:52:40,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:52:40,849 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 14:52:40,850 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 14:52:40,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:40,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 14:52:40,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:52:41,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 827 proven. 51 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2024-11-16 14:52:41,558 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:52:41,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 30 proven. 51 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-16 14:52:41,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419105882] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 14:52:41,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 14:52:41,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2024-11-16 14:52:41,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704063294] [2024-11-16 14:52:41,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 14:52:41,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 14:52:41,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:52:41,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 14:52:41,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-16 14:52:41,910 INFO L87 Difference]: Start difference. First operand 258 states and 378 transitions. Second operand has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 13 states have internal predecessors, (106), 6 states have call successors, (76), 3 states have call predecessors, (76), 6 states have return successors, (76), 6 states have call predecessors, (76), 6 states have call successors, (76) [2024-11-16 14:52:42,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:52:42,447 INFO L93 Difference]: Finished difference Result 484 states and 685 transitions. [2024-11-16 14:52:42,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 14:52:42,448 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 13 states have internal predecessors, (106), 6 states have call successors, (76), 3 states have call predecessors, (76), 6 states have return successors, (76), 6 states have call predecessors, (76), 6 states have call successors, (76) Word has length 191 [2024-11-16 14:52:42,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:52:42,450 INFO L225 Difference]: With dead ends: 484 [2024-11-16 14:52:42,450 INFO L226 Difference]: Without dead ends: 286 [2024-11-16 14:52:42,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 431 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=313, Unknown=0, NotChecked=0, Total=462 [2024-11-16 14:52:42,453 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 436 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 14:52:42,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 314 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 14:52:42,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-16 14:52:42,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 282. [2024-11-16 14:52:42,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 198 states have (on average 1.2525252525252526) internal successors, (248), 199 states have internal predecessors, (248), 70 states have call successors, (70), 13 states have call predecessors, (70), 13 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-16 14:52:42,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 388 transitions. [2024-11-16 14:52:42,483 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 388 transitions. Word has length 191 [2024-11-16 14:52:42,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:52:42,483 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 388 transitions. [2024-11-16 14:52:42,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 13 states have internal predecessors, (106), 6 states have call successors, (76), 3 states have call predecessors, (76), 6 states have return successors, (76), 6 states have call predecessors, (76), 6 states have call successors, (76) [2024-11-16 14:52:42,483 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 388 transitions. [2024-11-16 14:52:42,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-16 14:52:42,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:52:42,485 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:52:42,499 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 14:52:42,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:52:42,690 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:52:42,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:52:42,691 INFO L85 PathProgramCache]: Analyzing trace with hash 840585701, now seen corresponding path program 1 times [2024-11-16 14:52:42,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:52:42,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267943942] [2024-11-16 14:52:42,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:52:42,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:52:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:42,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:52:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:42,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:52:42,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:42,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:52:42,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:42,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:52:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:42,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:52:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:42,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:52:42,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:42,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 14:52:42,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:42,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:52:42,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:42,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:52:42,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:42,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:52:42,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:42,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 14:52:42,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:42,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 14:52:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:42,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 14:52:42,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:42,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 14:52:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:42,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 14:52:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:42,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 14:52:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:42,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 14:52:42,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:42,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 14:52:42,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:42,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 14:52:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:42,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:52:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:42,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:52:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:42,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:52:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:42,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:52:42,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:42,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 14:52:42,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:42,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 14:52:42,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:42,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 14:52:42,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:42,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 14:52:42,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:42,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 14:52:42,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:42,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-16 14:52:42,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:52:42,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267943942] [2024-11-16 14:52:42,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267943942] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 14:52:42,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551163855] [2024-11-16 14:52:42,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:52:42,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:52:42,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:52:42,943 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 14:52:42,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 14:52:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:43,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 14:52:43,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:52:43,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 777 proven. 36 refuted. 0 times theorem prover too weak. 699 trivial. 0 not checked. [2024-11-16 14:52:43,194 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:52:43,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-16 14:52:43,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551163855] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 14:52:43,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 14:52:43,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-16 14:52:43,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723230891] [2024-11-16 14:52:43,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 14:52:43,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 14:52:43,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:52:43,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 14:52:43,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-16 14:52:43,362 INFO L87 Difference]: Start difference. First operand 282 states and 388 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 3 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (57), 3 states have call predecessors, (57), 3 states have call successors, (57) [2024-11-16 14:52:43,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:52:43,606 INFO L93 Difference]: Finished difference Result 423 states and 573 transitions. [2024-11-16 14:52:43,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 14:52:43,606 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 3 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (57), 3 states have call predecessors, (57), 3 states have call successors, (57) Word has length 194 [2024-11-16 14:52:43,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:52:43,607 INFO L225 Difference]: With dead ends: 423 [2024-11-16 14:52:43,608 INFO L226 Difference]: Without dead ends: 226 [2024-11-16 14:52:43,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 440 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2024-11-16 14:52:43,609 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 243 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 14:52:43,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 278 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 14:52:43,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-16 14:52:43,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 221. [2024-11-16 14:52:43,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 152 states have (on average 1.236842105263158) internal successors, (188), 152 states have internal predecessors, (188), 56 states have call successors, (56), 12 states have call predecessors, (56), 12 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-16 14:52:43,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 300 transitions. [2024-11-16 14:52:43,623 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 300 transitions. Word has length 194 [2024-11-16 14:52:43,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:52:43,623 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 300 transitions. [2024-11-16 14:52:43,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 3 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (57), 3 states have call predecessors, (57), 3 states have call successors, (57) [2024-11-16 14:52:43,624 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 300 transitions. [2024-11-16 14:52:43,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-16 14:52:43,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:52:43,625 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:52:43,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 14:52:43,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-16 14:52:43,830 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:52:43,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:52:43,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1269912894, now seen corresponding path program 1 times [2024-11-16 14:52:43,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:52:43,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437066562] [2024-11-16 14:52:43,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:52:43,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:52:43,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:44,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:52:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:44,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:52:44,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:44,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:52:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:44,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:52:44,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:44,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:52:44,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:44,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:52:44,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:44,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 14:52:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:44,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:52:44,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:44,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:52:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:44,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:52:44,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:44,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 14:52:44,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:44,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 14:52:44,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:44,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 14:52:44,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:44,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 14:52:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:44,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 14:52:44,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:44,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 14:52:44,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:44,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 14:52:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:44,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 14:52:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:44,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 14:52:44,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:44,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:52:44,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:44,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:52:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:44,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:52:44,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:44,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:52:44,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:44,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 14:52:44,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:44,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 14:52:44,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:44,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 14:52:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:44,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 14:52:44,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:44,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 14:52:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:44,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-16 14:52:44,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:52:44,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437066562] [2024-11-16 14:52:44,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437066562] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 14:52:44,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370322439] [2024-11-16 14:52:44,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:52:44,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:52:44,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:52:44,200 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 14:52:44,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 14:52:44,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:44,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-16 14:52:44,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:52:44,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 788 proven. 84 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2024-11-16 14:52:44,990 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:52:45,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 72 proven. 87 refuted. 0 times theorem prover too weak. 1353 trivial. 0 not checked. [2024-11-16 14:52:45,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370322439] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 14:52:45,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 14:52:45,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 20 [2024-11-16 14:52:45,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062109940] [2024-11-16 14:52:45,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 14:52:45,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-16 14:52:45,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:52:45,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-16 14:52:45,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2024-11-16 14:52:45,428 INFO L87 Difference]: Start difference. First operand 221 states and 300 transitions. Second operand has 20 states, 19 states have (on average 7.684210526315789) internal successors, (146), 18 states have internal predecessors, (146), 8 states have call successors, (84), 4 states have call predecessors, (84), 8 states have return successors, (84), 8 states have call predecessors, (84), 8 states have call successors, (84) [2024-11-16 14:52:46,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:52:46,317 INFO L93 Difference]: Finished difference Result 443 states and 601 transitions. [2024-11-16 14:52:46,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-16 14:52:46,318 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 7.684210526315789) internal successors, (146), 18 states have internal predecessors, (146), 8 states have call successors, (84), 4 states have call predecessors, (84), 8 states have return successors, (84), 8 states have call predecessors, (84), 8 states have call successors, (84) Word has length 194 [2024-11-16 14:52:46,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:52:46,320 INFO L225 Difference]: With dead ends: 443 [2024-11-16 14:52:46,320 INFO L226 Difference]: Without dead ends: 314 [2024-11-16 14:52:46,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 428 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=247, Invalid=509, Unknown=0, NotChecked=0, Total=756 [2024-11-16 14:52:46,321 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 475 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 14:52:46,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 958 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 14:52:46,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-11-16 14:52:46,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 227. [2024-11-16 14:52:46,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 157 states have (on average 1.2292993630573248) internal successors, (193), 157 states have internal predecessors, (193), 56 states have call successors, (56), 13 states have call predecessors, (56), 13 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-16 14:52:46,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 305 transitions. [2024-11-16 14:52:46,341 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 305 transitions. Word has length 194 [2024-11-16 14:52:46,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:52:46,342 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 305 transitions. [2024-11-16 14:52:46,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 7.684210526315789) internal successors, (146), 18 states have internal predecessors, (146), 8 states have call successors, (84), 4 states have call predecessors, (84), 8 states have return successors, (84), 8 states have call predecessors, (84), 8 states have call successors, (84) [2024-11-16 14:52:46,342 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 305 transitions. [2024-11-16 14:52:46,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-16 14:52:46,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:52:46,344 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:52:46,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-16 14:52:46,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:52:46,549 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:52:46,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:52:46,550 INFO L85 PathProgramCache]: Analyzing trace with hash 2105862112, now seen corresponding path program 1 times [2024-11-16 14:52:46,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:52:46,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135515936] [2024-11-16 14:52:46,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:52:46,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:52:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 14:52:46,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1485094473] [2024-11-16 14:52:46,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:52:46,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:52:46,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:52:46,615 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 14:52:46,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-16 14:52:46,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 14:52:46,845 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 14:52:46,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 14:52:46,999 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 14:52:46,999 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 14:52:47,000 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 14:52:47,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-16 14:52:47,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:52:47,205 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:52:47,299 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 14:52:47,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 02:52:47 BoogieIcfgContainer [2024-11-16 14:52:47,301 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 14:52:47,302 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 14:52:47,302 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 14:52:47,302 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 14:52:47,302 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:52:36" (3/4) ... [2024-11-16 14:52:47,304 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 14:52:47,305 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 14:52:47,306 INFO L158 Benchmark]: Toolchain (without parser) took 11885.15ms. Allocated memory was 144.7MB in the beginning and 429.9MB in the end (delta: 285.2MB). Free memory was 77.2MB in the beginning and 338.7MB in the end (delta: -261.4MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2024-11-16 14:52:47,306 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 144.7MB. Free memory is still 110.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 14:52:47,306 INFO L158 Benchmark]: CACSL2BoogieTranslator took 338.47ms. Allocated memory was 144.7MB in the beginning and 220.2MB in the end (delta: 75.5MB). Free memory was 77.0MB in the beginning and 190.2MB in the end (delta: -113.2MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. [2024-11-16 14:52:47,306 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.69ms. Allocated memory is still 220.2MB. Free memory was 190.2MB in the beginning and 188.5MB in the end (delta: 1.7MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2024-11-16 14:52:47,306 INFO L158 Benchmark]: Boogie Preprocessor took 50.20ms. Allocated memory is still 220.2MB. Free memory was 188.5MB in the beginning and 181.1MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 14:52:47,306 INFO L158 Benchmark]: IcfgBuilder took 594.58ms. Allocated memory is still 220.2MB. Free memory was 181.1MB in the beginning and 144.4MB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-16 14:52:47,307 INFO L158 Benchmark]: TraceAbstraction took 10828.47ms. Allocated memory was 220.2MB in the beginning and 429.9MB in the end (delta: 209.7MB). Free memory was 143.4MB in the beginning and 339.7MB in the end (delta: -196.4MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2024-11-16 14:52:47,307 INFO L158 Benchmark]: Witness Printer took 3.45ms. Allocated memory is still 429.9MB. Free memory was 339.7MB in the beginning and 338.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 14:52:47,308 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.10ms. Allocated memory is still 144.7MB. Free memory is still 110.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 338.47ms. Allocated memory was 144.7MB in the beginning and 220.2MB in the end (delta: 75.5MB). Free memory was 77.0MB in the beginning and 190.2MB in the end (delta: -113.2MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.69ms. Allocated memory is still 220.2MB. Free memory was 190.2MB in the beginning and 188.5MB in the end (delta: 1.7MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.20ms. Allocated memory is still 220.2MB. Free memory was 188.5MB in the beginning and 181.1MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 594.58ms. Allocated memory is still 220.2MB. Free memory was 181.1MB in the beginning and 144.4MB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 10828.47ms. Allocated memory was 220.2MB in the beginning and 429.9MB in the end (delta: 209.7MB). Free memory was 143.4MB in the beginning and 339.7MB in the end (delta: -196.4MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * Witness Printer took 3.45ms. Allocated memory is still 429.9MB. Free memory was 339.7MB in the beginning and 338.7MB 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 bitwiseOr at line 86, overapproximation of someBinaryArithmeticDOUBLEoperation at line 113, overapproximation of bitwiseAnd at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 183. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 10; [L23] signed char var_1_3 = 1; [L24] signed char var_1_4 = 100; [L25] signed char var_1_5 = 5; [L26] signed char var_1_6 = 32; [L27] signed char var_1_7 = 32; [L28] unsigned short int var_1_8 = 8; [L29] unsigned short int var_1_10 = 21451; [L30] unsigned char var_1_12 = 8; [L31] unsigned short int var_1_13 = 16; [L32] unsigned short int var_1_16 = 53444; [L33] unsigned char var_1_17 = 0; [L34] unsigned char var_1_18 = 0; [L35] double var_1_19 = 1.2; [L36] signed char var_1_20 = 1; [L37] double var_1_21 = 10.5; [L38] double var_1_22 = 0.0; [L39] double var_1_23 = 10.4; [L40] double var_1_24 = 50.5; [L41] unsigned short int var_1_25 = 2; [L42] signed long int var_1_26 = 500; [L43] float var_1_31 = 99.375; [L44] unsigned char var_1_34 = 8; [L45] signed long int var_1_36 = 1; [L46] double var_1_37 = 100.5; [L47] unsigned char var_1_40 = 0; [L48] unsigned char var_1_41 = 1; [L49] unsigned char var_1_42 = 1; [L50] unsigned char var_1_43 = 1; [L51] unsigned short int var_1_44 = 0; [L52] double var_1_46 = 1.75; [L53] unsigned short int last_1_var_1_8 = 8; [L54] unsigned char last_1_var_1_12 = 8; [L55] unsigned short int last_1_var_1_13 = 16; [L56] unsigned char last_1_var_1_17 = 0; [L57] unsigned short int last_1_var_1_25 = 2; VAL [isInitial=0, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=1, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L187] isInitial = 1 [L188] FCALL initially() [L189] COND TRUE 1 [L190] CALL updateLastVariables() [L176] last_1_var_1_8 = var_1_8 [L177] last_1_var_1_12 = var_1_12 [L178] last_1_var_1_13 = var_1_13 [L179] last_1_var_1_17 = var_1_17 [L180] last_1_var_1_25 = var_1_25 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=1, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L190] RET updateLastVariables() [L191] CALL updateVariables() [L130] var_1_3 = __VERIFIER_nondet_char() [L131] CALL assume_abort_if_not(var_1_3 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L131] RET assume_abort_if_not(var_1_3 >= -127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L132] CALL assume_abort_if_not(var_1_3 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L132] RET assume_abort_if_not(var_1_3 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L133] var_1_4 = __VERIFIER_nondet_char() [L134] CALL assume_abort_if_not(var_1_4 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L134] RET assume_abort_if_not(var_1_4 >= -127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L135] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L135] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L136] var_1_5 = __VERIFIER_nondet_char() [L137] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=32, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=32, var_1_7=32, var_1_8=8] [L137] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=32, var_1_7=32, var_1_8=8] [L138] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=32, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=32, var_1_7=32, var_1_8=8] [L138] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=32, var_1_7=32, var_1_8=8] [L139] var_1_6 = __VERIFIER_nondet_char() [L140] CALL assume_abort_if_not(var_1_6 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=32, var_1_8=8] [L140] RET assume_abort_if_not(var_1_6 >= 31) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=32, var_1_8=8] [L141] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=32, var_1_8=8] [L141] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=32, var_1_8=8] [L142] var_1_7 = __VERIFIER_nondet_char() [L143] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L143] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L144] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L144] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L145] var_1_10 = __VERIFIER_nondet_ushort() [L146] CALL assume_abort_if_not(var_1_10 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L146] RET assume_abort_if_not(var_1_10 >= 16383) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L147] CALL assume_abort_if_not(var_1_10 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L147] RET assume_abort_if_not(var_1_10 <= 32767) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L148] var_1_16 = __VERIFIER_nondet_ushort() [L149] CALL assume_abort_if_not(var_1_16 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L149] RET assume_abort_if_not(var_1_16 >= 32767) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L150] CALL assume_abort_if_not(var_1_16 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L150] RET assume_abort_if_not(var_1_16 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L151] var_1_18 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L152] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L153] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L153] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L154] var_1_20 = __VERIFIER_nondet_char() [L155] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L155] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L156] CALL assume_abort_if_not(var_1_20 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L156] RET assume_abort_if_not(var_1_20 <= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L157] var_1_21 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L158] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L159] var_1_22 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_22 >= 4611686.018427382800e+12F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L160] RET assume_abort_if_not((var_1_22 >= 4611686.018427382800e+12F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L161] var_1_23 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L162] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L163] var_1_24 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L164] RET assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L165] var_1_41 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_41 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L166] RET assume_abort_if_not(var_1_41 >= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L167] CALL assume_abort_if_not(var_1_41 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L167] RET assume_abort_if_not(var_1_41 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L168] var_1_42 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_42 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L169] RET assume_abort_if_not(var_1_42 >= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L170] CALL assume_abort_if_not(var_1_42 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L170] RET assume_abort_if_not(var_1_42 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L171] var_1_43 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_43 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L172] RET assume_abort_if_not(var_1_43 >= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L173] CALL assume_abort_if_not(var_1_43 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L173] RET assume_abort_if_not(var_1_43 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L191] RET updateVariables() [L192] CALL step() [L61] COND FALSE !(var_1_17 && (var_1_5 > (var_1_7 / var_1_10))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L66] COND TRUE var_1_5 < var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L67] COND FALSE !(var_1_5 <= var_1_12) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L75] var_1_34 = var_1_7 [L76] var_1_36 = var_1_12 [L77] var_1_37 = (var_1_23 + var_1_23) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=1, var_1_36=8, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L78] COND TRUE var_1_21 < var_1_24 [L79] var_1_40 = (! ((var_1_41 && var_1_42) && var_1_43)) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=1, var_1_36=8, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L81] EXPR 25 & var_1_6 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=1, var_1_36=8, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L81] COND FALSE !((25 & var_1_6) < (var_1_12 - 25)) [L86] EXPR var_1_13 ^ var_1_16 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=1, var_1_36=8, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L86] COND FALSE !(5u < (var_1_13 ^ var_1_16)) [L93] var_1_46 = var_1_24 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_24=2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=1, var_1_36=8, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=2, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L95] COND TRUE (last_1_var_1_8 < last_1_var_1_13) || last_1_var_1_17 [L96] var_1_25 = (((((last_1_var_1_12) > (last_1_var_1_12)) ? (last_1_var_1_12) : (last_1_var_1_12))) + var_1_7) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_24=2, var_1_25=9, var_1_26=500, var_1_31=795/8, var_1_34=1, var_1_36=8, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=2, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L100] signed long int stepLocal_1 = last_1_var_1_13; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_1=16, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_24=2, var_1_25=9, var_1_26=500, var_1_31=795/8, var_1_34=1, var_1_36=8, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=2, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L101] COND TRUE last_1_var_1_13 == stepLocal_1 [L102] var_1_12 = ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=1, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_24=2, var_1_25=9, var_1_26=500, var_1_31=795/8, var_1_34=1, var_1_36=8, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=2, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=8] [L104] var_1_8 = (((var_1_7 + var_1_6) + var_1_12) + (var_1_10 - var_1_12)) [L105] signed long int stepLocal_0 = -1000000; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_0=-1000000, var_1_10=-32769, var_1_12=1, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_24=2, var_1_25=9, var_1_26=500, var_1_31=795/8, var_1_34=1, var_1_36=8, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=2, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=32799] [L106] COND TRUE var_1_8 >= stepLocal_0 [L107] var_1_1 = ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=1, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=0, var_1_20=126, var_1_24=2, var_1_25=9, var_1_26=500, var_1_31=795/8, var_1_34=1, var_1_36=8, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=2, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=32799] [L111] signed char stepLocal_3 = var_1_1; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_3=0, var_1_10=-32769, var_1_12=1, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=0, var_1_20=126, var_1_24=2, var_1_25=9, var_1_26=500, var_1_31=795/8, var_1_34=1, var_1_36=8, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=2, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=32799] [L112] COND TRUE stepLocal_3 >= (var_1_5 - var_1_20) [L113] var_1_19 = (((((var_1_21) < ((var_1_22 - var_1_23))) ? (var_1_21) : ((var_1_22 - var_1_23)))) - var_1_24) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=1, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=126, var_1_24=2, var_1_25=9, var_1_26=500, var_1_31=795/8, var_1_34=1, var_1_36=8, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=2, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=32799] [L115] COND TRUE ((((((((last_1_var_1_12) > (var_1_6)) ? (last_1_var_1_12) : (var_1_6)))) < (last_1_var_1_8)) ? (((((last_1_var_1_12) > (var_1_6)) ? (last_1_var_1_12) : (var_1_6)))) : (last_1_var_1_8))) > (var_1_3 * last_1_var_1_25) [L116] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=1, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=126, var_1_24=2, var_1_25=9, var_1_26=500, var_1_31=795/8, var_1_34=1, var_1_36=8, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=2, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=32799] [L118] unsigned short int stepLocal_2 = var_1_25; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_2=9, var_1_10=-32769, var_1_12=1, var_1_13=16, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=126, var_1_24=2, var_1_25=9, var_1_26=500, var_1_31=795/8, var_1_34=1, var_1_36=8, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=2, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=32799] [L119] COND FALSE !(\read(var_1_17)) [L126] var_1_13 = (var_1_16 - var_1_10) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_2=9, var_1_10=-32769, var_1_12=1, var_1_13=32767, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=126, var_1_24=2, var_1_25=9, var_1_26=500, var_1_31=795/8, var_1_34=1, var_1_36=8, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=2, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=32799] [L192] RET step() [L193] CALL, EXPR property() [L183] EXPR ((((var_1_8 >= -1000000) ? (var_1_1 == ((signed char) ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) : (var_1_1 == ((signed char) (var_1_5 - ((var_1_6 - 8) + var_1_7))))) && (var_1_8 == ((unsigned short int) (((var_1_7 + var_1_6) + var_1_12) + (var_1_10 - var_1_12))))) && ((last_1_var_1_13 == last_1_var_1_13) ? (var_1_12 == ((unsigned char) ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))))) : 1)) && (var_1_17 ? ((((var_1_10 + var_1_12) << var_1_5) < var_1_25) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_12 + var_1_12))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10)))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=1, var_1_13=32767, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=126, var_1_24=2, var_1_25=9, var_1_26=500, var_1_31=795/8, var_1_34=1, var_1_36=8, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=2, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=32799] [L183] EXPR var_1_17 ? ((((var_1_10 + var_1_12) << var_1_5) < var_1_25) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_12 + var_1_12))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=1, var_1_13=32767, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=126, var_1_24=2, var_1_25=9, var_1_26=500, var_1_31=795/8, var_1_34=1, var_1_36=8, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=2, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=32799] [L183] EXPR ((((var_1_8 >= -1000000) ? (var_1_1 == ((signed char) ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) : (var_1_1 == ((signed char) (var_1_5 - ((var_1_6 - 8) + var_1_7))))) && (var_1_8 == ((unsigned short int) (((var_1_7 + var_1_6) + var_1_12) + (var_1_10 - var_1_12))))) && ((last_1_var_1_13 == last_1_var_1_13) ? (var_1_12 == ((unsigned char) ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))))) : 1)) && (var_1_17 ? ((((var_1_10 + var_1_12) << var_1_5) < var_1_25) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_12 + var_1_12))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10)))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=1, var_1_13=32767, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=126, var_1_24=2, var_1_25=9, var_1_26=500, var_1_31=795/8, var_1_34=1, var_1_36=8, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=2, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=32799] [L183-L184] return (((((((var_1_8 >= -1000000) ? (var_1_1 == ((signed char) ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) : (var_1_1 == ((signed char) (var_1_5 - ((var_1_6 - 8) + var_1_7))))) && (var_1_8 == ((unsigned short int) (((var_1_7 + var_1_6) + var_1_12) + (var_1_10 - var_1_12))))) && ((last_1_var_1_13 == last_1_var_1_13) ? (var_1_12 == ((unsigned char) ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))))) : 1)) && (var_1_17 ? ((((var_1_10 + var_1_12) << var_1_5) < var_1_25) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_12 + var_1_12))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10))))) && ((((((((((last_1_var_1_12) > (var_1_6)) ? (last_1_var_1_12) : (var_1_6)))) < (last_1_var_1_8)) ? (((((last_1_var_1_12) > (var_1_6)) ? (last_1_var_1_12) : (var_1_6)))) : (last_1_var_1_8))) > (var_1_3 * last_1_var_1_25)) ? (var_1_17 == ((unsigned char) var_1_18)) : 1)) && ((var_1_1 >= (var_1_5 - var_1_20)) ? (var_1_19 == ((double) (((((var_1_21) < ((var_1_22 - var_1_23))) ? (var_1_21) : ((var_1_22 - var_1_23)))) - var_1_24))) : 1)) && (((last_1_var_1_8 < last_1_var_1_13) || last_1_var_1_17) ? (var_1_25 == ((unsigned short int) (((((last_1_var_1_12) > (last_1_var_1_12)) ? (last_1_var_1_12) : (last_1_var_1_12))) + var_1_7))) : (var_1_25 == ((unsigned short int) var_1_7))) ; [L193] RET, EXPR property() [L193] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=1, var_1_13=32767, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=126, var_1_24=2, var_1_25=9, var_1_26=500, var_1_31=795/8, var_1_34=1, var_1_36=8, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=2, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=32799] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=1, var_1_13=32767, var_1_16=-65538, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=126, var_1_24=2, var_1_25=9, var_1_26=500, var_1_31=795/8, var_1_34=1, var_1_36=8, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=2, var_1_4=0, var_1_5=126, var_1_6=31, var_1_7=1, var_1_8=32799] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.7s, OverallIterations: 11, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1572 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1557 mSDsluCounter, 4214 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2674 mSDsCounter, 314 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1864 IncrementalHoareTripleChecker+Invalid, 2178 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 314 mSolverCounterUnsat, 1540 mSDtfsCounter, 1864 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1808 GetRequests, 1734 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=363occurred in iteration=5, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 207 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 2866 NumberOfCodeBlocks, 2866 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3039 ConstructedInterpolants, 0 QuantifiedInterpolants, 9724 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1372 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 16 InterpolantComputations, 7 PerfectInterpolantSequences, 23694/24192 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 14:52:47,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_fillercode_fillercodestructure_filler-ps-ci_file-21.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 970538dd9083d93a461fb14f2c7c5ecaf35f3c2afcba98b5255f20442a223b33 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 14:52:49,375 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 14:52:49,440 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 14:52:49,443 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 14:52:49,444 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 14:52:49,460 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 14:52:49,462 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 14:52:49,462 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 14:52:49,463 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 14:52:49,463 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 14:52:49,463 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 14:52:49,464 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 14:52:49,464 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 14:52:49,465 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 14:52:49,465 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 14:52:49,466 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 14:52:49,467 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 14:52:49,467 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 14:52:49,467 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 14:52:49,470 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 14:52:49,470 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 14:52:49,470 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 14:52:49,470 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 14:52:49,471 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 14:52:49,471 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 14:52:49,472 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 14:52:49,472 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 14:52:49,472 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 14:52:49,473 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 14:52:49,473 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 14:52:49,473 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 14:52:49,473 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 14:52:49,473 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 14:52:49,475 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 14:52:49,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:52:49,475 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 14:52:49,475 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 14:52:49,475 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 14:52:49,476 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 14:52:49,476 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 14:52:49,476 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 14:52:49,477 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 14:52:49,477 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 14:52:49,477 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 14:52:49,477 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 -> 970538dd9083d93a461fb14f2c7c5ecaf35f3c2afcba98b5255f20442a223b33 [2024-11-16 14:52:49,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 14:52:49,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 14:52:49,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 14:52:49,758 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 14:52:49,758 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 14:52:49,759 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-21.i [2024-11-16 14:52:51,297 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 14:52:51,648 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 14:52:51,654 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-21.i [2024-11-16 14:52:51,676 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4021eb9b3/e455bf4905ed40f48b4fb11df44889e4/FLAG55b8ba7f4 [2024-11-16 14:52:51,921 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4021eb9b3/e455bf4905ed40f48b4fb11df44889e4 [2024-11-16 14:52:51,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 14:52:51,926 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 14:52:51,927 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 14:52:51,927 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 14:52:51,940 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 14:52:51,944 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:52:51" (1/1) ... [2024-11-16 14:52:51,945 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2600e3f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:52:51, skipping insertion in model container [2024-11-16 14:52:51,945 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:52:51" (1/1) ... [2024-11-16 14:52:52,004 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 14:52:52,191 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_fillercode_fillercodestructure_filler-ps-ci_file-21.i[919,932] [2024-11-16 14:52:52,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:52:52,291 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 14:52:52,322 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-21.i[919,932] [2024-11-16 14:52:52,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:52:52,382 INFO L204 MainTranslator]: Completed translation [2024-11-16 14:52:52,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:52:52 WrapperNode [2024-11-16 14:52:52,383 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 14:52:52,384 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 14:52:52,385 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 14:52:52,385 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 14:52:52,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:52:52" (1/1) ... [2024-11-16 14:52:52,405 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:52:52" (1/1) ... [2024-11-16 14:52:52,441 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 193 [2024-11-16 14:52:52,442 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 14:52:52,443 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 14:52:52,443 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 14:52:52,443 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 14:52:52,465 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:52:52" (1/1) ... [2024-11-16 14:52:52,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:52:52" (1/1) ... [2024-11-16 14:52:52,471 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:52:52" (1/1) ... [2024-11-16 14:52:52,487 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 14:52:52,491 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:52:52" (1/1) ... [2024-11-16 14:52:52,491 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:52:52" (1/1) ... [2024-11-16 14:52:52,503 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:52:52" (1/1) ... [2024-11-16 14:52:52,503 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:52:52" (1/1) ... [2024-11-16 14:52:52,509 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:52:52" (1/1) ... [2024-11-16 14:52:52,510 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:52:52" (1/1) ... [2024-11-16 14:52:52,516 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 14:52:52,517 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 14:52:52,517 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 14:52:52,517 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 14:52:52,521 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:52:52" (1/1) ... [2024-11-16 14:52:52,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:52:52,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:52:52,556 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 14:52:52,558 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 14:52:52,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 14:52:52,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 14:52:52,605 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 14:52:52,605 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 14:52:52,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 14:52:52,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 14:52:52,690 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 14:52:52,695 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 14:52:54,517 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-16 14:52:54,517 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 14:52:54,533 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 14:52:54,533 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 14:52:54,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:52:54 BoogieIcfgContainer [2024-11-16 14:52:54,533 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 14:52:54,537 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 14:52:54,537 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 14:52:54,540 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 14:52:54,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 02:52:51" (1/3) ... [2024-11-16 14:52:54,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@772b0922 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:52:54, skipping insertion in model container [2024-11-16 14:52:54,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:52:52" (2/3) ... [2024-11-16 14:52:54,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@772b0922 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:52:54, skipping insertion in model container [2024-11-16 14:52:54,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:52:54" (3/3) ... [2024-11-16 14:52:54,543 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-21.i [2024-11-16 14:52:54,557 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 14:52:54,557 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 14:52:54,609 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 14:52:54,622 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;@4b7721ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 14:52:54,622 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 14:52:54,630 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 58 states have (on average 1.396551724137931) internal successors, (81), 59 states have internal predecessors, (81), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 14:52:54,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-16 14:52:54,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:52:54,643 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:52:54,643 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:52:54,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:52:54,647 INFO L85 PathProgramCache]: Analyzing trace with hash 698892520, now seen corresponding path program 1 times [2024-11-16 14:52:54,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:52:54,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942489827] [2024-11-16 14:52:54,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:52:54,659 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 14:52:54,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:52:54,662 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 14:52:54,683 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 14:52:55,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:55,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 14:52:55,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:52:55,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 1018 trivial. 0 not checked. [2024-11-16 14:52:55,092 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 14:52:55,092 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 14:52:55,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942489827] [2024-11-16 14:52:55,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [942489827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:52:55,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:52:55,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 14:52:55,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296941010] [2024-11-16 14:52:55,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:52:55,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 14:52:55,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 14:52:55,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 14:52:55,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 14:52:55,123 INFO L87 Difference]: Start difference. First operand has 89 states, 58 states have (on average 1.396551724137931) internal successors, (81), 59 states have internal predecessors, (81), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 14:52:55,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:52:55,161 INFO L93 Difference]: Finished difference Result 170 states and 295 transitions. [2024-11-16 14:52:55,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 14:52:55,164 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 183 [2024-11-16 14:52:55,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:52:55,172 INFO L225 Difference]: With dead ends: 170 [2024-11-16 14:52:55,173 INFO L226 Difference]: Without dead ends: 84 [2024-11-16 14:52:55,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 182 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 14:52:55,182 INFO L432 NwaCegarLoop]: 129 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, 129 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 14:52:55,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 14:52:55,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-16 14:52:55,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-16 14:52:55,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 14:52:55,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 129 transitions. [2024-11-16 14:52:55,237 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 129 transitions. Word has length 183 [2024-11-16 14:52:55,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:52:55,239 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 129 transitions. [2024-11-16 14:52:55,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 14:52:55,240 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 129 transitions. [2024-11-16 14:52:55,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-16 14:52:55,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:52:55,243 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:52:55,254 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 14:52:55,444 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 14:52:55,444 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:52:55,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:52:55,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1646202396, now seen corresponding path program 1 times [2024-11-16 14:52:55,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:52:55,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2031888482] [2024-11-16 14:52:55,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:52:55,449 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 14:52:55,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:52:55,454 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 14:52:55,456 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 14:52:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:55,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 14:52:55,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:52:56,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 771 proven. 45 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2024-11-16 14:52:56,632 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:52:56,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 14:52:56,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2031888482] [2024-11-16 14:52:56,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2031888482] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 14:52:56,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [856683722] [2024-11-16 14:52:56,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:52:56,841 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 14:52:56,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 14:52:56,843 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 14:52:56,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-16 14:52:57,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:57,682 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 14:52:57,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:52:57,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 727 proven. 51 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2024-11-16 14:52:57,889 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:52:57,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [856683722] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 14:52:57,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 14:52:57,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-11-16 14:52:57,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221081001] [2024-11-16 14:52:57,937 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 14:52:57,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 14:52:57,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 14:52:57,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 14:52:57,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-16 14:52:57,939 INFO L87 Difference]: Start difference. First operand 84 states and 129 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 4 states have call successors, (56), 4 states have call predecessors, (56), 6 states have return successors, (56), 4 states have call predecessors, (56), 4 states have call successors, (56) [2024-11-16 14:53:00,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:53:00,369 INFO L93 Difference]: Finished difference Result 255 states and 387 transitions. [2024-11-16 14:53:00,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-16 14:53:00,370 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 4 states have call successors, (56), 4 states have call predecessors, (56), 6 states have return successors, (56), 4 states have call predecessors, (56), 4 states have call successors, (56) Word has length 183 [2024-11-16 14:53:00,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:53:00,375 INFO L225 Difference]: With dead ends: 255 [2024-11-16 14:53:00,375 INFO L226 Difference]: Without dead ends: 174 [2024-11-16 14:53:00,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 487 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2024-11-16 14:53:00,379 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 183 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-16 14:53:00,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 395 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-16 14:53:00,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-16 14:53:00,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 158. [2024-11-16 14:53:00,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 96 states have (on average 1.25) internal successors, (120), 96 states have internal predecessors, (120), 56 states have call successors, (56), 5 states have call predecessors, (56), 5 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-16 14:53:00,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 232 transitions. [2024-11-16 14:53:00,425 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 232 transitions. Word has length 183 [2024-11-16 14:53:00,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:53:00,426 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 232 transitions. [2024-11-16 14:53:00,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 4 states have call successors, (56), 4 states have call predecessors, (56), 6 states have return successors, (56), 4 states have call predecessors, (56), 4 states have call successors, (56) [2024-11-16 14:53:00,426 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 232 transitions. [2024-11-16 14:53:00,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-16 14:53:00,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:53:00,428 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:53:00,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-16 14:53:00,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-16 14:53:00,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 14:53:00,834 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:53:00,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:53:00,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1167716008, now seen corresponding path program 1 times [2024-11-16 14:53:00,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:53:00,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [363299451] [2024-11-16 14:53:00,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:53:00,839 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 14:53:00,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:53:00,842 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 14:53:00,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-16 14:53:01,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:53:01,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 14:53:01,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:53:01,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 777 proven. 36 refuted. 0 times theorem prover too weak. 699 trivial. 0 not checked. [2024-11-16 14:53:01,354 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:53:01,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-16 14:53:01,620 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 14:53:01,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [363299451] [2024-11-16 14:53:01,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [363299451] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 14:53:01,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 14:53:01,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-16 14:53:01,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754589947] [2024-11-16 14:53:01,621 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 14:53:01,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 14:53:01,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 14:53:01,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 14:53:01,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 14:53:01,624 INFO L87 Difference]: Start difference. First operand 158 states and 232 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2024-11-16 14:53:02,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:53:02,835 INFO L93 Difference]: Finished difference Result 259 states and 373 transitions. [2024-11-16 14:53:02,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 14:53:02,849 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 185 [2024-11-16 14:53:02,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:53:02,852 INFO L225 Difference]: With dead ends: 259 [2024-11-16 14:53:02,852 INFO L226 Difference]: Without dead ends: 174 [2024-11-16 14:53:02,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 362 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-16 14:53:02,853 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 114 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 14:53:02,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 222 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 14:53:02,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-16 14:53:02,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 166. [2024-11-16 14:53:02,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 102 states have (on average 1.2254901960784315) internal successors, (125), 102 states have internal predecessors, (125), 56 states have call successors, (56), 7 states have call predecessors, (56), 7 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-16 14:53:02,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 237 transitions. [2024-11-16 14:53:02,870 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 237 transitions. Word has length 185 [2024-11-16 14:53:02,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:53:02,870 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 237 transitions. [2024-11-16 14:53:02,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2024-11-16 14:53:02,871 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 237 transitions. [2024-11-16 14:53:02,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-16 14:53:02,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:53:02,873 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:53:02,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-16 14:53:03,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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 14:53:03,077 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:53:03,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:53:03,077 INFO L85 PathProgramCache]: Analyzing trace with hash 657181831, now seen corresponding path program 1 times [2024-11-16 14:53:03,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:53:03,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2010461642] [2024-11-16 14:53:03,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:53:03,078 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 14:53:03,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:53:03,087 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 14:53:03,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-16 14:53:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:53:03,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-16 14:53:03,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:53:37,422 WARN L286 SmtUtils]: Spent 5.17s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)