./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-33.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-33.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 9fba8bcd82b4a3fe57500a406293d5d51cfc2c8d1877a7a6552e09538ec18fb3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:57:52,375 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:57:52,453 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:57:52,460 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:57:52,461 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:57:52,495 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:57:52,496 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:57:52,497 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:57:52,497 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:57:52,499 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:57:52,499 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:57:52,500 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:57:52,500 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:57:52,502 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:57:52,502 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:57:52,503 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:57:52,503 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:57:52,503 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:57:52,503 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:57:52,504 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:57:52,504 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:57:52,506 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:57:52,507 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:57:52,507 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:57:52,507 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:57:52,507 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:57:52,508 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:57:52,508 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:57:52,508 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:57:52,508 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:57:52,508 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:57:52,508 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:57:52,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:57:52,509 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:57:52,509 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:57:52,509 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:57:52,509 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:57:52,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:57:52,510 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:57:52,510 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:57:52,511 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:57:52,511 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:57:52,511 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 -> 9fba8bcd82b4a3fe57500a406293d5d51cfc2c8d1877a7a6552e09538ec18fb3 [2024-10-24 11:57:52,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:57:52,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:57:52,753 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:57:52,755 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:57:52,755 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:57:52,756 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-33.i [2024-10-24 11:57:54,210 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:57:54,406 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:57:54,407 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-33.i [2024-10-24 11:57:54,417 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96ce40c73/f52b06d58a4e4350bf6245070d0803d9/FLAG6429b7cd6 [2024-10-24 11:57:54,431 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96ce40c73/f52b06d58a4e4350bf6245070d0803d9 [2024-10-24 11:57:54,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:57:54,435 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:57:54,436 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:57:54,437 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:57:54,441 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:57:54,442 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:57:54" (1/1) ... [2024-10-24 11:57:54,443 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a3ace41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:54, skipping insertion in model container [2024-10-24 11:57:54,443 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:57:54" (1/1) ... [2024-10-24 11:57:54,470 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:57:54,633 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-33.i[917,930] [2024-10-24 11:57:54,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:57:54,706 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:57:54,717 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-33.i[917,930] [2024-10-24 11:57:54,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:57:54,777 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:57:54,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:54 WrapperNode [2024-10-24 11:57:54,781 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:57:54,782 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:57:54,782 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:57:54,782 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:57:54,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:54" (1/1) ... [2024-10-24 11:57:54,805 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:54" (1/1) ... [2024-10-24 11:57:54,851 INFO L138 Inliner]: procedures = 29, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 476 [2024-10-24 11:57:54,851 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:57:54,852 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:57:54,852 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:57:54,852 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:57:54,862 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:54" (1/1) ... [2024-10-24 11:57:54,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:54" (1/1) ... [2024-10-24 11:57:54,870 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:54" (1/1) ... [2024-10-24 11:57:54,892 INFO L175 MemorySlicer]: Split 115 memory accesses to 2 slices as follows [2, 113]. 98 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 15 writes are split as follows [0, 15]. [2024-10-24 11:57:54,892 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:54" (1/1) ... [2024-10-24 11:57:54,893 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:54" (1/1) ... [2024-10-24 11:57:54,910 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:54" (1/1) ... [2024-10-24 11:57:54,915 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:54" (1/1) ... [2024-10-24 11:57:54,918 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:54" (1/1) ... [2024-10-24 11:57:54,920 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:54" (1/1) ... [2024-10-24 11:57:54,925 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:57:54,926 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:57:54,926 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:57:54,927 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:57:54,927 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:54" (1/1) ... [2024-10-24 11:57:54,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:57:54,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:57:54,968 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:57:54,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:57:55,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:57:55,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:57:55,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:57:55,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:57:55,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:57:55,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:57:55,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:57:55,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:57:55,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:57:55,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:57:55,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:57:55,025 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:57:55,025 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:57:55,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:57:55,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:57:55,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:57:55,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:57:55,165 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:57:55,167 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:57:55,694 INFO L? ?]: Removed 138 outVars from TransFormulas that were not future-live. [2024-10-24 11:57:55,694 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:57:55,730 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:57:55,730 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:57:55,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:57:55 BoogieIcfgContainer [2024-10-24 11:57:55,731 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:57:55,734 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:57:55,734 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:57:55,737 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:57:55,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:57:54" (1/3) ... [2024-10-24 11:57:55,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b9cf89b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:57:55, skipping insertion in model container [2024-10-24 11:57:55,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:54" (2/3) ... [2024-10-24 11:57:55,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b9cf89b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:57:55, skipping insertion in model container [2024-10-24 11:57:55,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:57:55" (3/3) ... [2024-10-24 11:57:55,740 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-33.i [2024-10-24 11:57:55,755 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:57:55,755 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:57:55,844 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:57:55,849 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;@5aba655d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:57:55,850 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:57:55,854 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 88 states have (on average 1.5113636363636365) internal successors, (133), 89 states have internal predecessors, (133), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:57:55,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 11:57:55,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:57:55,871 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:57:55,871 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:57:55,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:57:55,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1872169063, now seen corresponding path program 1 times [2024-10-24 11:57:55,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:57:55,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122506865] [2024-10-24 11:57:55,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:55,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:57:56,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:56,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:57:56,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:56,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:57:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:56,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:57:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:56,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:57:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:56,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:57:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:56,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:57:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:56,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:57:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:56,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:57:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:56,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:57:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:56,306 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:57:56,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:57:56,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122506865] [2024-10-24 11:57:56,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122506865] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:57:56,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:57:56,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:57:56,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598822499] [2024-10-24 11:57:56,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:57:56,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:57:56,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:57:56,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:57:56,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:57:56,338 INFO L87 Difference]: Start difference. First operand has 100 states, 88 states have (on average 1.5113636363636365) internal successors, (133), 89 states have internal predecessors, (133), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:57:56,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:57:56,390 INFO L93 Difference]: Finished difference Result 197 states and 309 transitions. [2024-10-24 11:57:56,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:57:56,393 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 93 [2024-10-24 11:57:56,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:57:56,403 INFO L225 Difference]: With dead ends: 197 [2024-10-24 11:57:56,404 INFO L226 Difference]: Without dead ends: 98 [2024-10-24 11:57:56,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:57:56,411 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:57:56,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:57:56,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-24 11:57:56,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-24 11:57:56,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 87 states have (on average 1.471264367816092) internal successors, (128), 87 states have internal predecessors, (128), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:57:56,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 146 transitions. [2024-10-24 11:57:56,459 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 146 transitions. Word has length 93 [2024-10-24 11:57:56,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:57:56,460 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 146 transitions. [2024-10-24 11:57:56,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:57:56,461 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 146 transitions. [2024-10-24 11:57:56,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 11:57:56,467 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:57:56,468 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:57:56,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:57:56,468 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:57:56,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:57:56,469 INFO L85 PathProgramCache]: Analyzing trace with hash 355821211, now seen corresponding path program 1 times [2024-10-24 11:57:56,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:57:56,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188162560] [2024-10-24 11:57:56,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:56,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:57:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:56,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:57:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:56,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:57:56,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:56,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:57:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:56,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:57:56,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:56,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:57:56,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:56,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:57:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:56,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:57:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:56,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:57:56,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:56,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:57:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:56,825 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:57:56,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:57:56,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188162560] [2024-10-24 11:57:56,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188162560] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:57:56,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:57:56,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:57:56,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276339321] [2024-10-24 11:57:56,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:57:56,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:57:56,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:57:56,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:57:56,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:57:56,835 INFO L87 Difference]: Start difference. First operand 98 states and 146 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:57:56,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:57:56,899 INFO L93 Difference]: Finished difference Result 197 states and 294 transitions. [2024-10-24 11:57:56,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:57:56,906 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), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 93 [2024-10-24 11:57:56,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:57:56,907 INFO L225 Difference]: With dead ends: 197 [2024-10-24 11:57:56,908 INFO L226 Difference]: Without dead ends: 100 [2024-10-24 11:57:56,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:57:56,912 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:57:56,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 413 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:57:56,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-24 11:57:56,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-10-24 11:57:56,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 89 states have (on average 1.4606741573033708) internal successors, (130), 89 states have internal predecessors, (130), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:57:56,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 148 transitions. [2024-10-24 11:57:56,930 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 148 transitions. Word has length 93 [2024-10-24 11:57:56,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:57:56,932 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 148 transitions. [2024-10-24 11:57:56,932 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), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:57:56,932 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 148 transitions. [2024-10-24 11:57:56,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 11:57:56,934 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:57:56,934 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:57:56,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:57:56,935 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:57:56,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:57:56,935 INFO L85 PathProgramCache]: Analyzing trace with hash 371339929, now seen corresponding path program 1 times [2024-10-24 11:57:56,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:57:56,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694190171] [2024-10-24 11:57:56,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:56,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:57:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:57,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:57:57,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:57,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:57:57,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:57,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:57:57,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:57,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:57:57,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:57,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:57:57,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:57,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:57:57,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:57,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:57:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:57,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:57:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:57,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:57:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:57,149 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:57:57,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:57:57,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694190171] [2024-10-24 11:57:57,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694190171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:57:57,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:57:57,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:57:57,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072998209] [2024-10-24 11:57:57,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:57:57,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:57:57,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:57:57,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:57:57,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:57:57,152 INFO L87 Difference]: Start difference. First operand 100 states and 148 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:57:57,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:57:57,258 INFO L93 Difference]: Finished difference Result 202 states and 299 transitions. [2024-10-24 11:57:57,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:57:57,263 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 93 [2024-10-24 11:57:57,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:57:57,264 INFO L225 Difference]: With dead ends: 202 [2024-10-24 11:57:57,264 INFO L226 Difference]: Without dead ends: 103 [2024-10-24 11:57:57,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:57:57,267 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 1 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:57:57,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 410 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:57:57,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-24 11:57:57,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2024-10-24 11:57:57,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 91 states have (on average 1.4505494505494505) internal successors, (132), 91 states have internal predecessors, (132), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:57:57,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 150 transitions. [2024-10-24 11:57:57,284 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 150 transitions. Word has length 93 [2024-10-24 11:57:57,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:57:57,284 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 150 transitions. [2024-10-24 11:57:57,284 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:57:57,285 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 150 transitions. [2024-10-24 11:57:57,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 11:57:57,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:57:57,286 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:57:57,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:57:57,290 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:57:57,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:57:57,291 INFO L85 PathProgramCache]: Analyzing trace with hash 428598231, now seen corresponding path program 1 times [2024-10-24 11:57:57,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:57:57,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625102905] [2024-10-24 11:57:57,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:57,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:57:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:57,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:57:57,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:57,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:57:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:57,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:57:57,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:57,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:57:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:57,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:57:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:57,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:57:57,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:57,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:57:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:57,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:57:57,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:57,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:57:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:57,470 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:57:57,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:57:57,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625102905] [2024-10-24 11:57:57,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625102905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:57:57,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:57:57,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:57:57,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585590880] [2024-10-24 11:57:57,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:57:57,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:57:57,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:57:57,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:57:57,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:57:57,474 INFO L87 Difference]: Start difference. First operand 102 states and 150 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:57:57,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:57:57,522 INFO L93 Difference]: Finished difference Result 206 states and 303 transitions. [2024-10-24 11:57:57,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:57:57,526 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 93 [2024-10-24 11:57:57,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:57:57,527 INFO L225 Difference]: With dead ends: 206 [2024-10-24 11:57:57,528 INFO L226 Difference]: Without dead ends: 105 [2024-10-24 11:57:57,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:57:57,529 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 1 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:57:57,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 414 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:57:57,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-24 11:57:57,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2024-10-24 11:57:57,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 93 states have internal predecessors, (134), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:57:57,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 152 transitions. [2024-10-24 11:57:57,546 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 152 transitions. Word has length 93 [2024-10-24 11:57:57,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:57:57,546 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 152 transitions. [2024-10-24 11:57:57,547 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:57:57,547 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 152 transitions. [2024-10-24 11:57:57,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 11:57:57,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:57:57,551 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:57:57,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:57:57,552 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:57:57,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:57:57,552 INFO L85 PathProgramCache]: Analyzing trace with hash 428657813, now seen corresponding path program 1 times [2024-10-24 11:57:57,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:57:57,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169799366] [2024-10-24 11:57:57,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:57,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:57:57,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:58,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:57:58,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:58,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:57:58,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:58,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:57:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:58,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:57:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:58,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:57:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:58,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:57:58,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:58,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:57:58,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:58,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:57:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:58,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:57:58,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:58,799 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-24 11:57:58,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:57:58,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169799366] [2024-10-24 11:57:58,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169799366] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:57:58,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305551741] [2024-10-24 11:57:58,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:58,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:57:58,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:57:58,802 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:57:58,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 11:57:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:58,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-24 11:57:59,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:57:59,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2024-10-24 11:57:59,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2024-10-24 11:57:59,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2024-10-24 11:57:59,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2024-10-24 11:57:59,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2024-10-24 11:58:00,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:58:00,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2024-10-24 11:58:00,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:58:00,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2024-10-24 11:58:00,284 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 74 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-24 11:58:00,286 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:58:00,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305551741] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:58:00,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:58:00,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-10-24 11:58:00,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495654514] [2024-10-24 11:58:00,395 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:58:00,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 11:58:00,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:58:00,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 11:58:00,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2024-10-24 11:58:00,399 INFO L87 Difference]: Start difference. First operand 104 states and 152 transitions. Second operand has 16 states, 14 states have (on average 5.928571428571429) internal successors, (83), 15 states have internal predecessors, (83), 6 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2024-10-24 11:58:00,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:00,997 INFO L93 Difference]: Finished difference Result 259 states and 374 transitions. [2024-10-24 11:58:00,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 11:58:00,998 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 5.928571428571429) internal successors, (83), 15 states have internal predecessors, (83), 6 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) Word has length 93 [2024-10-24 11:58:00,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:01,000 INFO L225 Difference]: With dead ends: 259 [2024-10-24 11:58:01,000 INFO L226 Difference]: Without dead ends: 156 [2024-10-24 11:58:01,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2024-10-24 11:58:01,002 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 95 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:01,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 973 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:58:01,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-24 11:58:01,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 149. [2024-10-24 11:58:01,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 127 states have (on average 1.3937007874015748) internal successors, (177), 127 states have internal predecessors, (177), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 11:58:01,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 213 transitions. [2024-10-24 11:58:01,028 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 213 transitions. Word has length 93 [2024-10-24 11:58:01,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:01,029 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 213 transitions. [2024-10-24 11:58:01,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 5.928571428571429) internal successors, (83), 15 states have internal predecessors, (83), 6 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2024-10-24 11:58:01,029 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 213 transitions. [2024-10-24 11:58:01,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 11:58:01,031 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:01,031 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:58:01,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 11:58:01,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:58:01,232 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:01,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:01,233 INFO L85 PathProgramCache]: Analyzing trace with hash -80815277, now seen corresponding path program 1 times [2024-10-24 11:58:01,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:58:01,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726545869] [2024-10-24 11:58:01,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:01,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:58:01,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:09,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:58:09,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:09,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:58:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:09,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:58:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:09,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:58:09,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:09,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:58:09,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:09,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:58:09,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:09,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:58:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:09,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:58:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:09,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:58:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:09,854 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:58:09,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:58:09,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726545869] [2024-10-24 11:58:09,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726545869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:09,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:09,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 11:58:09,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754088442] [2024-10-24 11:58:09,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:09,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 11:58:09,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:58:09,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 11:58:09,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:58:09,857 INFO L87 Difference]: Start difference. First operand 149 states and 213 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-24 11:58:10,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:10,489 INFO L93 Difference]: Finished difference Result 410 states and 595 transitions. [2024-10-24 11:58:10,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:58:10,490 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 93 [2024-10-24 11:58:10,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:10,492 INFO L225 Difference]: With dead ends: 410 [2024-10-24 11:58:10,492 INFO L226 Difference]: Without dead ends: 307 [2024-10-24 11:58:10,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-24 11:58:10,497 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 434 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:10,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 667 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:58:10,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-10-24 11:58:10,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 265. [2024-10-24 11:58:10,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 233 states have (on average 1.4206008583690988) internal successors, (331), 233 states have internal predecessors, (331), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 11:58:10,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 385 transitions. [2024-10-24 11:58:10,517 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 385 transitions. Word has length 93 [2024-10-24 11:58:10,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:10,518 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 385 transitions. [2024-10-24 11:58:10,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-24 11:58:10,519 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 385 transitions. [2024-10-24 11:58:10,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 11:58:10,522 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:10,522 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:58:10,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 11:58:10,523 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:10,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:10,523 INFO L85 PathProgramCache]: Analyzing trace with hash 930301973, now seen corresponding path program 1 times [2024-10-24 11:58:10,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:58:10,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432017799] [2024-10-24 11:58:10,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:10,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:58:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:11,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:58:11,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:11,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:58:11,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:11,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:58:11,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:11,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:58:11,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:11,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:58:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:11,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:58:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:11,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:58:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:11,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:58:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:11,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:58:11,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:11,224 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:58:11,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:58:11,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432017799] [2024-10-24 11:58:11,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432017799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:11,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:11,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:58:11,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938521896] [2024-10-24 11:58:11,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:11,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:58:11,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:58:11,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:58:11,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:58:11,226 INFO L87 Difference]: Start difference. First operand 265 states and 385 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:58:11,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:11,556 INFO L93 Difference]: Finished difference Result 533 states and 778 transitions. [2024-10-24 11:58:11,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:58:11,557 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 93 [2024-10-24 11:58:11,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:11,559 INFO L225 Difference]: With dead ends: 533 [2024-10-24 11:58:11,559 INFO L226 Difference]: Without dead ends: 314 [2024-10-24 11:58:11,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:58:11,560 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 261 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:11,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 393 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:58:11,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-10-24 11:58:11,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 275. [2024-10-24 11:58:11,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 243 states have (on average 1.4156378600823045) internal successors, (344), 243 states have internal predecessors, (344), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 11:58:11,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 398 transitions. [2024-10-24 11:58:11,583 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 398 transitions. Word has length 93 [2024-10-24 11:58:11,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:11,584 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 398 transitions. [2024-10-24 11:58:11,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:58:11,584 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 398 transitions. [2024-10-24 11:58:11,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 11:58:11,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:11,585 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:58:11,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 11:58:11,586 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:11,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:11,586 INFO L85 PathProgramCache]: Analyzing trace with hash -299669995, now seen corresponding path program 1 times [2024-10-24 11:58:11,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:58:11,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470100551] [2024-10-24 11:58:11,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:11,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:58:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:11,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:58:11,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:11,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:58:11,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:11,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:58:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:11,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:58:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:12,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:58:12,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:12,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:58:12,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:12,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:58:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:12,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:58:12,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:12,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:58:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:12,020 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:58:12,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:58:12,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470100551] [2024-10-24 11:58:12,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470100551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:12,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:12,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:58:12,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944388991] [2024-10-24 11:58:12,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:12,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:58:12,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:58:12,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:58:12,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:58:12,023 INFO L87 Difference]: Start difference. First operand 275 states and 398 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:12,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:12,284 INFO L93 Difference]: Finished difference Result 597 states and 868 transitions. [2024-10-24 11:58:12,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:58:12,285 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 93 [2024-10-24 11:58:12,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:12,289 INFO L225 Difference]: With dead ends: 597 [2024-10-24 11:58:12,289 INFO L226 Difference]: Without dead ends: 368 [2024-10-24 11:58:12,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:58:12,290 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 183 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:12,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 665 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:58:12,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-10-24 11:58:12,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 279. [2024-10-24 11:58:12,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 247 states have (on average 1.408906882591093) internal successors, (348), 247 states have internal predecessors, (348), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 11:58:12,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 402 transitions. [2024-10-24 11:58:12,319 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 402 transitions. Word has length 93 [2024-10-24 11:58:12,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:12,319 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 402 transitions. [2024-10-24 11:58:12,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:12,320 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 402 transitions. [2024-10-24 11:58:12,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-24 11:58:12,321 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:12,321 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:58:12,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 11:58:12,322 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:12,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:12,322 INFO L85 PathProgramCache]: Analyzing trace with hash -302981968, now seen corresponding path program 1 times [2024-10-24 11:58:12,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:58:12,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438875150] [2024-10-24 11:58:12,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:12,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:58:12,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:12,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:58:12,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:12,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:58:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:12,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:58:12,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:12,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:58:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:12,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:58:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:12,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:58:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:12,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:58:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:12,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:58:12,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:12,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:58:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:12,583 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:58:12,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:58:12,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438875150] [2024-10-24 11:58:12,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438875150] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:12,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:12,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:58:12,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405732470] [2024-10-24 11:58:12,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:12,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:58:12,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:58:12,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:58:12,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:58:12,586 INFO L87 Difference]: Start difference. First operand 279 states and 402 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:12,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:12,791 INFO L93 Difference]: Finished difference Result 612 states and 883 transitions. [2024-10-24 11:58:12,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:58:12,792 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 94 [2024-10-24 11:58:12,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:12,795 INFO L225 Difference]: With dead ends: 612 [2024-10-24 11:58:12,795 INFO L226 Difference]: Without dead ends: 379 [2024-10-24 11:58:12,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:58:12,796 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 304 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:12,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 392 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:58:12,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-10-24 11:58:12,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 303. [2024-10-24 11:58:12,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 271 states have (on average 1.4095940959409594) internal successors, (382), 271 states have internal predecessors, (382), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 11:58:12,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 436 transitions. [2024-10-24 11:58:12,824 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 436 transitions. Word has length 94 [2024-10-24 11:58:12,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:12,825 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 436 transitions. [2024-10-24 11:58:12,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:12,825 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 436 transitions. [2024-10-24 11:58:12,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 11:58:12,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:12,826 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:58:12,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 11:58:12,826 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:12,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:12,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1687965368, now seen corresponding path program 1 times [2024-10-24 11:58:12,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:58:12,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485977138] [2024-10-24 11:58:12,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:12,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:58:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:13,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:58:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:13,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:58:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:13,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:58:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:13,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:58:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:13,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:58:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:13,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:58:13,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:13,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:58:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:13,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:58:13,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:13,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:58:13,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:13,605 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:58:13,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:58:13,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485977138] [2024-10-24 11:58:13,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485977138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:13,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:13,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:58:13,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497249343] [2024-10-24 11:58:13,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:13,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:58:13,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:58:13,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:58:13,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:58:13,607 INFO L87 Difference]: Start difference. First operand 303 states and 436 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:13,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:13,884 INFO L93 Difference]: Finished difference Result 639 states and 924 transitions. [2024-10-24 11:58:13,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:58:13,885 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 95 [2024-10-24 11:58:13,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:13,887 INFO L225 Difference]: With dead ends: 639 [2024-10-24 11:58:13,887 INFO L226 Difference]: Without dead ends: 382 [2024-10-24 11:58:13,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:58:13,888 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 348 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:13,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 517 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:58:13,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-10-24 11:58:13,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 347. [2024-10-24 11:58:13,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 315 states have (on average 1.415873015873016) internal successors, (446), 315 states have internal predecessors, (446), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 11:58:13,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 500 transitions. [2024-10-24 11:58:13,920 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 500 transitions. Word has length 95 [2024-10-24 11:58:13,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:13,921 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 500 transitions. [2024-10-24 11:58:13,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:13,921 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 500 transitions. [2024-10-24 11:58:13,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 11:58:13,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:13,922 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:58:13,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 11:58:13,922 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:13,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:13,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1101159354, now seen corresponding path program 1 times [2024-10-24 11:58:13,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:58:13,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790628075] [2024-10-24 11:58:13,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:13,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:58:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:14,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:58:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:14,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:58:14,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:14,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:58:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:14,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:58:14,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:14,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:58:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:14,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:58:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:14,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:58:14,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:14,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:58:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:14,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:58:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:14,066 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:58:14,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:58:14,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790628075] [2024-10-24 11:58:14,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790628075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:14,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:14,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:58:14,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484537487] [2024-10-24 11:58:14,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:14,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:58:14,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:58:14,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:58:14,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:58:14,068 INFO L87 Difference]: Start difference. First operand 347 states and 500 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:14,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:14,118 INFO L93 Difference]: Finished difference Result 653 states and 945 transitions. [2024-10-24 11:58:14,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:58:14,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 95 [2024-10-24 11:58:14,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:14,121 INFO L225 Difference]: With dead ends: 653 [2024-10-24 11:58:14,122 INFO L226 Difference]: Without dead ends: 352 [2024-10-24 11:58:14,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:58:14,123 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:14,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 545 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:58:14,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-10-24 11:58:14,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2024-10-24 11:58:14,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 320 states have (on average 1.409375) internal successors, (451), 320 states have internal predecessors, (451), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 11:58:14,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 505 transitions. [2024-10-24 11:58:14,153 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 505 transitions. Word has length 95 [2024-10-24 11:58:14,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:14,153 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 505 transitions. [2024-10-24 11:58:14,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:14,154 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 505 transitions. [2024-10-24 11:58:14,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 11:58:14,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:14,155 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:58:14,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 11:58:14,155 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:14,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:14,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1052712232, now seen corresponding path program 1 times [2024-10-24 11:58:14,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:58:14,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611131956] [2024-10-24 11:58:14,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:14,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:58:14,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:14,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:58:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:14,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:58:14,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:14,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:58:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:14,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:58:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:14,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:58:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:14,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:58:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:14,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:58:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:14,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:58:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:14,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:58:14,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:14,256 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:58:14,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:58:14,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611131956] [2024-10-24 11:58:14,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611131956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:14,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:14,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:58:14,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254384756] [2024-10-24 11:58:14,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:14,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:58:14,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:58:14,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:58:14,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:58:14,259 INFO L87 Difference]: Start difference. First operand 352 states and 505 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:14,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:14,298 INFO L93 Difference]: Finished difference Result 529 states and 766 transitions. [2024-10-24 11:58:14,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:58:14,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 95 [2024-10-24 11:58:14,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:14,301 INFO L225 Difference]: With dead ends: 529 [2024-10-24 11:58:14,301 INFO L226 Difference]: Without dead ends: 359 [2024-10-24 11:58:14,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:58:14,302 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:14,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 277 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:58:14,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-10-24 11:58:14,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2024-10-24 11:58:14,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 327 states have (on average 1.400611620795107) internal successors, (458), 327 states have internal predecessors, (458), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 11:58:14,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 512 transitions. [2024-10-24 11:58:14,333 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 512 transitions. Word has length 95 [2024-10-24 11:58:14,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:14,333 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 512 transitions. [2024-10-24 11:58:14,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:14,334 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 512 transitions. [2024-10-24 11:58:14,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 11:58:14,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:14,335 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:58:14,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 11:58:14,335 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:14,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:14,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1740036547, now seen corresponding path program 1 times [2024-10-24 11:58:14,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:58:14,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385512576] [2024-10-24 11:58:14,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:14,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:58:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:14,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:58:14,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:14,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:58:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:14,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:58:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:14,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:58:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:14,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:58:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:14,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:58:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:14,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:58:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:14,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:58:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:14,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:58:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:14,584 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:58:14,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:58:14,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385512576] [2024-10-24 11:58:14,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385512576] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:14,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:14,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:58:14,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178820528] [2024-10-24 11:58:14,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:14,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:58:14,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:58:14,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:58:14,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:58:14,586 INFO L87 Difference]: Start difference. First operand 359 states and 512 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:14,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:14,850 INFO L93 Difference]: Finished difference Result 745 states and 1056 transitions. [2024-10-24 11:58:14,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:58:14,850 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-10-24 11:58:14,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:14,853 INFO L225 Difference]: With dead ends: 745 [2024-10-24 11:58:14,853 INFO L226 Difference]: Without dead ends: 432 [2024-10-24 11:58:14,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:58:14,854 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 176 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:14,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 510 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:58:14,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-10-24 11:58:14,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 350. [2024-10-24 11:58:14,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 318 states have (on average 1.3836477987421383) internal successors, (440), 318 states have internal predecessors, (440), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 11:58:14,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 494 transitions. [2024-10-24 11:58:14,883 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 494 transitions. Word has length 96 [2024-10-24 11:58:14,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:14,883 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 494 transitions. [2024-10-24 11:58:14,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:14,884 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 494 transitions. [2024-10-24 11:58:14,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 11:58:14,884 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:14,885 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:58:14,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 11:58:14,885 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:14,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:14,885 INFO L85 PathProgramCache]: Analyzing trace with hash -977426827, now seen corresponding path program 1 times [2024-10-24 11:58:14,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:58:14,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455091951] [2024-10-24 11:58:14,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:14,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:58:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:15,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:58:15,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:15,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:58:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:15,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:58:15,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:15,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:58:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:15,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:58:15,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:15,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:58:15,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:15,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:58:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:15,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:58:15,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:15,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:58:15,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:15,607 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:58:15,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:58:15,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455091951] [2024-10-24 11:58:15,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455091951] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:15,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:15,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 11:58:15,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021894815] [2024-10-24 11:58:15,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:15,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 11:58:15,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:58:15,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 11:58:15,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:58:15,610 INFO L87 Difference]: Start difference. First operand 350 states and 494 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:16,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:16,452 INFO L93 Difference]: Finished difference Result 919 states and 1303 transitions. [2024-10-24 11:58:16,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 11:58:16,453 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-10-24 11:58:16,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:16,456 INFO L225 Difference]: With dead ends: 919 [2024-10-24 11:58:16,456 INFO L226 Difference]: Without dead ends: 615 [2024-10-24 11:58:16,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2024-10-24 11:58:16,457 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 306 mSDsluCounter, 1213 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:16,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 1398 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 11:58:16,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-10-24 11:58:16,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 392. [2024-10-24 11:58:16,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 360 states have (on average 1.4055555555555554) internal successors, (506), 360 states have internal predecessors, (506), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 11:58:16,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 560 transitions. [2024-10-24 11:58:16,485 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 560 transitions. Word has length 96 [2024-10-24 11:58:16,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:16,485 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 560 transitions. [2024-10-24 11:58:16,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:16,486 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 560 transitions. [2024-10-24 11:58:16,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 11:58:16,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:16,488 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:58:16,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 11:58:16,488 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:16,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:16,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1474401332, now seen corresponding path program 1 times [2024-10-24 11:58:16,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:58:16,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657262462] [2024-10-24 11:58:16,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:16,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:58:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:16,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:58:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:16,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:58:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:16,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:58:16,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:16,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:58:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:16,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:58:16,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:16,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:58:16,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:16,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:58:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:16,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:58:16,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:16,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:58:16,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:16,765 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:58:16,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:58:16,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657262462] [2024-10-24 11:58:16,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657262462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:16,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:16,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:58:16,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031912329] [2024-10-24 11:58:16,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:16,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:58:16,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:58:16,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:58:16,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:58:16,768 INFO L87 Difference]: Start difference. First operand 392 states and 560 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:17,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:17,120 INFO L93 Difference]: Finished difference Result 939 states and 1335 transitions. [2024-10-24 11:58:17,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 11:58:17,120 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-10-24 11:58:17,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:17,124 INFO L225 Difference]: With dead ends: 939 [2024-10-24 11:58:17,124 INFO L226 Difference]: Without dead ends: 593 [2024-10-24 11:58:17,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:58:17,127 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 284 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:17,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 719 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:58:17,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2024-10-24 11:58:17,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 414. [2024-10-24 11:58:17,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 382 states have (on average 1.405759162303665) internal successors, (537), 382 states have internal predecessors, (537), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 11:58:17,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 591 transitions. [2024-10-24 11:58:17,159 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 591 transitions. Word has length 96 [2024-10-24 11:58:17,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:17,160 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 591 transitions. [2024-10-24 11:58:17,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:17,160 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 591 transitions. [2024-10-24 11:58:17,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-24 11:58:17,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:17,175 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:58:17,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 11:58:17,175 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:17,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:17,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1031320768, now seen corresponding path program 1 times [2024-10-24 11:58:17,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:58:17,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505831059] [2024-10-24 11:58:17,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:17,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:58:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:17,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:58:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:17,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:58:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:17,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:58:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:17,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:58:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:17,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:58:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:17,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:58:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:17,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:58:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:17,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:58:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:17,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:58:17,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:17,602 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:58:17,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:58:17,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505831059] [2024-10-24 11:58:17,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505831059] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:17,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:17,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 11:58:17,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769651290] [2024-10-24 11:58:17,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:17,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 11:58:17,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:58:17,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 11:58:17,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:58:17,604 INFO L87 Difference]: Start difference. First operand 414 states and 591 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:18,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:18,332 INFO L93 Difference]: Finished difference Result 1075 states and 1521 transitions. [2024-10-24 11:58:18,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 11:58:18,333 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2024-10-24 11:58:18,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:18,336 INFO L225 Difference]: With dead ends: 1075 [2024-10-24 11:58:18,336 INFO L226 Difference]: Without dead ends: 707 [2024-10-24 11:58:18,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2024-10-24 11:58:18,337 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 405 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:18,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 1293 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 11:58:18,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2024-10-24 11:58:18,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 429. [2024-10-24 11:58:18,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 397 states have (on average 1.420654911838791) internal successors, (564), 397 states have internal predecessors, (564), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 11:58:18,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 618 transitions. [2024-10-24 11:58:18,370 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 618 transitions. Word has length 97 [2024-10-24 11:58:18,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:18,370 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 618 transitions. [2024-10-24 11:58:18,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:18,370 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 618 transitions. [2024-10-24 11:58:18,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-24 11:58:18,372 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:18,372 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:58:18,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 11:58:18,372 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:18,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:18,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1935052249, now seen corresponding path program 1 times [2024-10-24 11:58:18,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:58:18,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842323779] [2024-10-24 11:58:18,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:18,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:58:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:18,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:58:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:18,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:58:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:18,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:58:18,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:18,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:58:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:18,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:58:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:18,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:58:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:18,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:58:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:18,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:58:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:18,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:58:18,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:18,957 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:58:18,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:58:18,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842323779] [2024-10-24 11:58:18,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842323779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:18,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:18,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 11:58:18,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784752034] [2024-10-24 11:58:18,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:18,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 11:58:18,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:58:18,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 11:58:18,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:58:18,959 INFO L87 Difference]: Start difference. First operand 429 states and 618 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:19,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:19,568 INFO L93 Difference]: Finished difference Result 1293 states and 1858 transitions. [2024-10-24 11:58:19,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 11:58:19,569 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2024-10-24 11:58:19,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:19,573 INFO L225 Difference]: With dead ends: 1293 [2024-10-24 11:58:19,573 INFO L226 Difference]: Without dead ends: 910 [2024-10-24 11:58:19,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2024-10-24 11:58:19,575 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 563 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:19,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 871 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:58:19,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2024-10-24 11:58:19,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 505. [2024-10-24 11:58:19,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 473 states have (on average 1.4503171247357294) internal successors, (686), 473 states have internal predecessors, (686), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 11:58:19,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 740 transitions. [2024-10-24 11:58:19,608 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 740 transitions. Word has length 97 [2024-10-24 11:58:19,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:19,608 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 740 transitions. [2024-10-24 11:58:19,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:19,609 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 740 transitions. [2024-10-24 11:58:19,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-24 11:58:19,610 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:19,610 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:58:19,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 11:58:19,610 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:19,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:19,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1565593963, now seen corresponding path program 1 times [2024-10-24 11:58:19,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:58:19,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38261179] [2024-10-24 11:58:19,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:19,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:58:19,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:20,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:58:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:20,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:58:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:20,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:58:20,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:20,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:58:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:20,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:58:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:20,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:58:20,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:20,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:58:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:20,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:58:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:20,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:58:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:20,243 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:58:20,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:58:20,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38261179] [2024-10-24 11:58:20,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38261179] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:20,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:20,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 11:58:20,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462117271] [2024-10-24 11:58:20,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:20,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 11:58:20,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:58:20,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 11:58:20,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:58:20,246 INFO L87 Difference]: Start difference. First operand 505 states and 740 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:58:21,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:21,135 INFO L93 Difference]: Finished difference Result 1212 states and 1755 transitions. [2024-10-24 11:58:21,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 11:58:21,135 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 97 [2024-10-24 11:58:21,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:21,139 INFO L225 Difference]: With dead ends: 1212 [2024-10-24 11:58:21,139 INFO L226 Difference]: Without dead ends: 735 [2024-10-24 11:58:21,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=367, Unknown=0, NotChecked=0, Total=506 [2024-10-24 11:58:21,143 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 684 mSDsluCounter, 1046 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:21,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 1191 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 11:58:21,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2024-10-24 11:58:21,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 510. [2024-10-24 11:58:21,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 478 states have (on average 1.4393305439330544) internal successors, (688), 478 states have internal predecessors, (688), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 11:58:21,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 742 transitions. [2024-10-24 11:58:21,176 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 742 transitions. Word has length 97 [2024-10-24 11:58:21,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:21,176 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 742 transitions. [2024-10-24 11:58:21,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:58:21,177 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 742 transitions. [2024-10-24 11:58:21,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 11:58:21,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:21,178 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:58:21,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 11:58:21,178 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:21,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:21,179 INFO L85 PathProgramCache]: Analyzing trace with hash 2138588744, now seen corresponding path program 1 times [2024-10-24 11:58:21,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:58:21,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634826139] [2024-10-24 11:58:21,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:21,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:58:21,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:21,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:58:21,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:21,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:58:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:21,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:58:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:21,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:58:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:21,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:58:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:21,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:58:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:21,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:58:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:21,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:58:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:21,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:58:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:21,455 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:58:21,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:58:21,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634826139] [2024-10-24 11:58:21,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634826139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:21,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:21,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:58:21,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375445449] [2024-10-24 11:58:21,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:21,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:58:21,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:58:21,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:58:21,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:58:21,459 INFO L87 Difference]: Start difference. First operand 510 states and 742 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:58:21,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:21,816 INFO L93 Difference]: Finished difference Result 1115 states and 1616 transitions. [2024-10-24 11:58:21,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:58:21,817 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 98 [2024-10-24 11:58:21,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:21,819 INFO L225 Difference]: With dead ends: 1115 [2024-10-24 11:58:21,819 INFO L226 Difference]: Without dead ends: 651 [2024-10-24 11:58:21,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:58:21,823 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 323 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:21,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 459 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:58:21,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2024-10-24 11:58:21,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 497. [2024-10-24 11:58:21,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 465 states have (on average 1.421505376344086) internal successors, (661), 465 states have internal predecessors, (661), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 11:58:21,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 715 transitions. [2024-10-24 11:58:21,854 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 715 transitions. Word has length 98 [2024-10-24 11:58:21,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:21,855 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 715 transitions. [2024-10-24 11:58:21,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:58:21,855 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 715 transitions. [2024-10-24 11:58:21,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 11:58:21,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:21,856 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:58:21,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 11:58:21,856 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:21,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:21,857 INFO L85 PathProgramCache]: Analyzing trace with hash 366461682, now seen corresponding path program 1 times [2024-10-24 11:58:21,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:58:21,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677768164] [2024-10-24 11:58:21,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:21,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:58:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:22,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:58:22,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:22,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:58:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:22,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:58:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:22,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:58:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:22,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:58:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:22,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:58:22,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:22,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:58:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:22,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:58:22,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:22,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:58:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:22,628 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:58:22,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:58:22,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677768164] [2024-10-24 11:58:22,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677768164] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:22,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:22,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 11:58:22,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927080831] [2024-10-24 11:58:22,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:22,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 11:58:22,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:58:22,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 11:58:22,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:58:22,632 INFO L87 Difference]: Start difference. First operand 497 states and 715 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:23,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:23,536 INFO L93 Difference]: Finished difference Result 1124 states and 1612 transitions. [2024-10-24 11:58:23,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 11:58:23,539 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2024-10-24 11:58:23,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:23,542 INFO L225 Difference]: With dead ends: 1124 [2024-10-24 11:58:23,542 INFO L226 Difference]: Without dead ends: 673 [2024-10-24 11:58:23,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2024-10-24 11:58:23,545 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 232 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:23,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 1158 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 11:58:23,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2024-10-24 11:58:23,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 515. [2024-10-24 11:58:23,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 483 states have (on average 1.4182194616977226) internal successors, (685), 483 states have internal predecessors, (685), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 11:58:23,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 739 transitions. [2024-10-24 11:58:23,582 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 739 transitions. Word has length 98 [2024-10-24 11:58:23,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:23,582 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 739 transitions. [2024-10-24 11:58:23,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:23,583 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 739 transitions. [2024-10-24 11:58:23,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 11:58:23,584 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:23,584 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:58:23,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 11:58:23,584 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:23,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:23,585 INFO L85 PathProgramCache]: Analyzing trace with hash -938782628, now seen corresponding path program 1 times [2024-10-24 11:58:23,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:58:23,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150349630] [2024-10-24 11:58:23,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:23,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:58:23,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:24,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:58:24,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:24,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:58:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:24,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:58:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:24,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:58:24,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:24,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:58:24,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:24,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:58:24,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:24,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:58:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:24,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:58:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:24,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:58:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:24,196 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:58:24,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:58:24,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150349630] [2024-10-24 11:58:24,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150349630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:24,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:24,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 11:58:24,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024046512] [2024-10-24 11:58:24,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:24,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 11:58:24,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:58:24,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 11:58:24,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:58:24,198 INFO L87 Difference]: Start difference. First operand 515 states and 739 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:24,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:24,778 INFO L93 Difference]: Finished difference Result 1453 states and 2060 transitions. [2024-10-24 11:58:24,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 11:58:24,778 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2024-10-24 11:58:24,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:24,782 INFO L225 Difference]: With dead ends: 1453 [2024-10-24 11:58:24,782 INFO L226 Difference]: Without dead ends: 984 [2024-10-24 11:58:24,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2024-10-24 11:58:24,784 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 304 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 1143 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:24,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 1143 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:58:24,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2024-10-24 11:58:24,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 526. [2024-10-24 11:58:24,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 494 states have (on average 1.4210526315789473) internal successors, (702), 494 states have internal predecessors, (702), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 11:58:24,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 756 transitions. [2024-10-24 11:58:24,821 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 756 transitions. Word has length 98 [2024-10-24 11:58:24,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:24,821 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 756 transitions. [2024-10-24 11:58:24,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:24,822 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 756 transitions. [2024-10-24 11:58:24,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 11:58:24,823 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:24,823 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:58:24,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 11:58:24,823 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:24,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:24,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1815886372, now seen corresponding path program 1 times [2024-10-24 11:58:24,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:58:24,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188040820] [2024-10-24 11:58:24,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:24,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:58:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:25,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:58:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:25,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:58:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:25,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:58:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:25,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:58:25,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:25,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:58:25,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:25,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:58:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:25,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:58:25,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:25,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:58:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:25,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:58:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:25,924 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:58:25,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:58:25,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188040820] [2024-10-24 11:58:25,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188040820] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:25,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:25,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 11:58:25,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997731678] [2024-10-24 11:58:25,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:25,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:58:25,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:58:25,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:58:25,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:58:25,926 INFO L87 Difference]: Start difference. First operand 526 states and 756 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:58:26,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:26,307 INFO L93 Difference]: Finished difference Result 1010 states and 1454 transitions. [2024-10-24 11:58:26,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:58:26,308 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 98 [2024-10-24 11:58:26,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:26,310 INFO L225 Difference]: With dead ends: 1010 [2024-10-24 11:58:26,310 INFO L226 Difference]: Without dead ends: 530 [2024-10-24 11:58:26,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:58:26,311 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 118 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:26,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 615 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:58:26,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2024-10-24 11:58:26,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 508. [2024-10-24 11:58:26,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 476 states have (on average 1.411764705882353) internal successors, (672), 476 states have internal predecessors, (672), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 11:58:26,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 726 transitions. [2024-10-24 11:58:26,343 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 726 transitions. Word has length 98 [2024-10-24 11:58:26,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:26,343 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 726 transitions. [2024-10-24 11:58:26,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:58:26,344 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 726 transitions. [2024-10-24 11:58:26,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 11:58:26,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:26,345 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:58:26,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 11:58:26,345 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:26,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:26,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1684346100, now seen corresponding path program 1 times [2024-10-24 11:58:26,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:58:26,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13788837] [2024-10-24 11:58:26,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:26,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:58:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:26,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:58:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:26,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:58:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:26,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:58:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:26,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:58:26,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:26,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:58:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:26,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:58:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:26,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:58:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:26,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:58:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:26,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:58:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:26,473 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:58:26,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:58:26,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13788837] [2024-10-24 11:58:26,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13788837] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:26,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:26,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:58:26,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643185864] [2024-10-24 11:58:26,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:26,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:58:26,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:58:26,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:58:26,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:58:26,475 INFO L87 Difference]: Start difference. First operand 508 states and 726 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:26,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:26,528 INFO L93 Difference]: Finished difference Result 976 states and 1398 transitions. [2024-10-24 11:58:26,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:58:26,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 99 [2024-10-24 11:58:26,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:26,531 INFO L225 Difference]: With dead ends: 976 [2024-10-24 11:58:26,531 INFO L226 Difference]: Without dead ends: 514 [2024-10-24 11:58:26,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:58:26,533 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:26,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 545 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:58:26,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2024-10-24 11:58:26,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2024-10-24 11:58:26,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 482 states have (on average 1.4066390041493777) internal successors, (678), 482 states have internal predecessors, (678), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 11:58:26,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 732 transitions. [2024-10-24 11:58:26,564 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 732 transitions. Word has length 99 [2024-10-24 11:58:26,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:26,564 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 732 transitions. [2024-10-24 11:58:26,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:26,564 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 732 transitions. [2024-10-24 11:58:26,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 11:58:26,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:26,565 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:58:26,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-24 11:58:26,566 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:26,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:26,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1121581859, now seen corresponding path program 1 times [2024-10-24 11:58:26,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:58:26,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640915257] [2024-10-24 11:58:26,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:26,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:58:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:27,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:58:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:27,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:58:27,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:27,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:58:27,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:27,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:58:27,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:27,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:58:27,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:27,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:58:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:27,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:58:27,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:27,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:58:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:27,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:58:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:27,149 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:58:27,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:58:27,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640915257] [2024-10-24 11:58:27,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640915257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:27,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:27,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-24 11:58:27,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163017449] [2024-10-24 11:58:27,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:27,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 11:58:27,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:58:27,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 11:58:27,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:58:27,151 INFO L87 Difference]: Start difference. First operand 514 states and 732 transitions. Second operand has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:27,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:27,803 INFO L93 Difference]: Finished difference Result 1350 states and 1888 transitions. [2024-10-24 11:58:27,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 11:58:27,803 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 99 [2024-10-24 11:58:27,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:27,807 INFO L225 Difference]: With dead ends: 1350 [2024-10-24 11:58:27,807 INFO L226 Difference]: Without dead ends: 882 [2024-10-24 11:58:27,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2024-10-24 11:58:27,809 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 468 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:27,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 1114 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:58:27,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2024-10-24 11:58:27,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 525. [2024-10-24 11:58:27,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 493 states have (on average 1.40973630831643) internal successors, (695), 493 states have internal predecessors, (695), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 11:58:27,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 749 transitions. [2024-10-24 11:58:27,842 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 749 transitions. Word has length 99 [2024-10-24 11:58:27,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:27,843 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 749 transitions. [2024-10-24 11:58:27,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:27,843 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 749 transitions. [2024-10-24 11:58:27,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 11:58:27,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:27,844 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:58:27,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-24 11:58:27,845 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:27,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:27,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1232051303, now seen corresponding path program 1 times [2024-10-24 11:58:27,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:58:27,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381760254] [2024-10-24 11:58:27,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:27,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:58:27,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:29,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:58:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:29,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:58:29,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:29,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:58:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:29,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:58:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:29,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:58:29,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:29,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:58:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:29,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:58:29,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:29,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:58:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:29,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:58:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:29,102 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:58:29,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:58:29,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381760254] [2024-10-24 11:58:29,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381760254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:29,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:29,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 11:58:29,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878806138] [2024-10-24 11:58:29,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:29,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:58:29,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:58:29,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:58:29,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:58:29,104 INFO L87 Difference]: Start difference. First operand 525 states and 749 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:58:29,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:29,457 INFO L93 Difference]: Finished difference Result 1016 states and 1460 transitions. [2024-10-24 11:58:29,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:58:29,458 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 99 [2024-10-24 11:58:29,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:29,461 INFO L225 Difference]: With dead ends: 1016 [2024-10-24 11:58:29,461 INFO L226 Difference]: Without dead ends: 721 [2024-10-24 11:58:29,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:58:29,463 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 207 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:29,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 354 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:58:29,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2024-10-24 11:58:29,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 706. [2024-10-24 11:58:29,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 664 states have (on average 1.408132530120482) internal successors, (935), 664 states have internal predecessors, (935), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 11:58:29,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1007 transitions. [2024-10-24 11:58:29,502 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 1007 transitions. Word has length 99 [2024-10-24 11:58:29,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:29,502 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 1007 transitions. [2024-10-24 11:58:29,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:58:29,503 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1007 transitions. [2024-10-24 11:58:29,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 11:58:29,506 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:29,506 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:58:29,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-24 11:58:29,506 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:29,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:29,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1819399200, now seen corresponding path program 1 times [2024-10-24 11:58:29,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:58:29,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551644532] [2024-10-24 11:58:29,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:29,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:58:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:30,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:58:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:30,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:58:30,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:30,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:58:30,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:30,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:58:30,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:30,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:58:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:30,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:58:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:30,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:58:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:30,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:58:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:30,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:58:30,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:30,117 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:58:30,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:58:30,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551644532] [2024-10-24 11:58:30,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551644532] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:30,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:30,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 11:58:30,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088218256] [2024-10-24 11:58:30,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:30,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 11:58:30,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:58:30,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 11:58:30,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:58:30,120 INFO L87 Difference]: Start difference. First operand 706 states and 1007 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:30,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:30,930 INFO L93 Difference]: Finished difference Result 1773 states and 2520 transitions. [2024-10-24 11:58:30,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 11:58:30,931 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 99 [2024-10-24 11:58:30,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:30,935 INFO L225 Difference]: With dead ends: 1773 [2024-10-24 11:58:30,935 INFO L226 Difference]: Without dead ends: 1113 [2024-10-24 11:58:30,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2024-10-24 11:58:30,936 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 401 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:30,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 1162 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:58:30,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2024-10-24 11:58:30,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 783. [2024-10-24 11:58:30,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 741 states have (on average 1.4116059379217274) internal successors, (1046), 741 states have internal predecessors, (1046), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 11:58:30,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1118 transitions. [2024-10-24 11:58:30,997 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1118 transitions. Word has length 99 [2024-10-24 11:58:30,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:30,997 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 1118 transitions. [2024-10-24 11:58:30,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:30,998 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1118 transitions. [2024-10-24 11:58:30,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 11:58:30,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:30,999 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:58:30,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-24 11:58:30,999 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:30,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:30,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1046708183, now seen corresponding path program 1 times [2024-10-24 11:58:30,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:58:31,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457250955] [2024-10-24 11:58:31,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:31,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:58:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:31,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:58:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:31,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:58:31,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:31,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:58:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:31,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:58:31,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:31,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:58:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:31,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:58:31,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:31,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:58:31,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:31,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:58:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:31,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:58:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:31,740 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:58:31,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:58:31,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457250955] [2024-10-24 11:58:31,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457250955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:31,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:31,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 11:58:31,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690449965] [2024-10-24 11:58:31,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:31,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 11:58:31,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:58:31,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 11:58:31,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:58:31,742 INFO L87 Difference]: Start difference. First operand 783 states and 1118 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:32,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:32,663 INFO L93 Difference]: Finished difference Result 1874 states and 2647 transitions. [2024-10-24 11:58:32,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 11:58:32,663 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 99 [2024-10-24 11:58:32,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:32,668 INFO L225 Difference]: With dead ends: 1874 [2024-10-24 11:58:32,668 INFO L226 Difference]: Without dead ends: 1137 [2024-10-24 11:58:32,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2024-10-24 11:58:32,670 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 394 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:32,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 1222 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:58:32,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2024-10-24 11:58:32,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 788. [2024-10-24 11:58:32,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 746 states have (on average 1.4128686327077749) internal successors, (1054), 746 states have internal predecessors, (1054), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 11:58:32,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1126 transitions. [2024-10-24 11:58:32,729 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1126 transitions. Word has length 99 [2024-10-24 11:58:32,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:32,729 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1126 transitions. [2024-10-24 11:58:32,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:32,730 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1126 transitions. [2024-10-24 11:58:32,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 11:58:32,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:32,730 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:58:32,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-24 11:58:32,731 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:32,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:32,731 INFO L85 PathProgramCache]: Analyzing trace with hash -900381245, now seen corresponding path program 1 times [2024-10-24 11:58:32,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:58:32,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248554295] [2024-10-24 11:58:32,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:32,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:58:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:33,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:58:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:33,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:58:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:33,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:58:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:33,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:58:33,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:33,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:58:33,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:33,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:58:33,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:33,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:58:33,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:33,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:58:33,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:33,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:58:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:34,002 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:58:34,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:58:34,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248554295] [2024-10-24 11:58:34,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248554295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:34,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:34,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 11:58:34,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446394101] [2024-10-24 11:58:34,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:34,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:58:34,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:58:34,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:58:34,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:58:34,004 INFO L87 Difference]: Start difference. First operand 788 states and 1126 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:58:34,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:34,542 INFO L93 Difference]: Finished difference Result 1414 states and 2023 transitions. [2024-10-24 11:58:34,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:58:34,543 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 100 [2024-10-24 11:58:34,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:34,546 INFO L225 Difference]: With dead ends: 1414 [2024-10-24 11:58:34,546 INFO L226 Difference]: Without dead ends: 866 [2024-10-24 11:58:34,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:58:34,548 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 255 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:34,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 691 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:58:34,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2024-10-24 11:58:34,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 794. [2024-10-24 11:58:34,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 752 states have (on average 1.4148936170212767) internal successors, (1064), 752 states have internal predecessors, (1064), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 11:58:34,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1136 transitions. [2024-10-24 11:58:34,598 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1136 transitions. Word has length 100 [2024-10-24 11:58:34,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:34,599 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1136 transitions. [2024-10-24 11:58:34,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:58:34,599 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1136 transitions. [2024-10-24 11:58:34,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 11:58:34,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:34,601 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:58:34,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-24 11:58:34,601 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:34,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:34,602 INFO L85 PathProgramCache]: Analyzing trace with hash 2117556239, now seen corresponding path program 1 times [2024-10-24 11:58:34,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:58:34,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292431532] [2024-10-24 11:58:34,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:34,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:58:34,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:35,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:58:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:35,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:58:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:35,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:58:35,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:35,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:58:35,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:35,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:58:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:35,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:58:35,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:35,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:58:35,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:35,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:58:35,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:35,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:58:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:35,318 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:58:35,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:58:35,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292431532] [2024-10-24 11:58:35,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292431532] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:35,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:35,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 11:58:35,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058044558] [2024-10-24 11:58:35,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:35,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 11:58:35,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:58:35,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 11:58:35,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:58:35,321 INFO L87 Difference]: Start difference. First operand 794 states and 1136 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:35,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:35,932 INFO L93 Difference]: Finished difference Result 1761 states and 2504 transitions. [2024-10-24 11:58:35,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 11:58:35,933 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 100 [2024-10-24 11:58:35,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:35,936 INFO L225 Difference]: With dead ends: 1761 [2024-10-24 11:58:35,936 INFO L226 Difference]: Without dead ends: 1013 [2024-10-24 11:58:35,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2024-10-24 11:58:35,938 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 280 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:35,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 985 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:58:35,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2024-10-24 11:58:35,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 767. [2024-10-24 11:58:35,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 725 states have (on average 1.4068965517241379) internal successors, (1020), 725 states have internal predecessors, (1020), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 11:58:35,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1092 transitions. [2024-10-24 11:58:35,992 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1092 transitions. Word has length 100 [2024-10-24 11:58:35,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:35,992 INFO L471 AbstractCegarLoop]: Abstraction has 767 states and 1092 transitions. [2024-10-24 11:58:35,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:35,993 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1092 transitions. [2024-10-24 11:58:35,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 11:58:35,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:35,994 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:58:35,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-24 11:58:35,994 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:35,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:35,995 INFO L85 PathProgramCache]: Analyzing trace with hash 835067897, now seen corresponding path program 1 times [2024-10-24 11:58:35,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:58:35,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970401898] [2024-10-24 11:58:35,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:35,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:58:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:36,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:58:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:36,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:58:36,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:36,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:58:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:36,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:58:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:36,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:58:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:36,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:58:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:36,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:58:36,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:36,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:58:36,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:36,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:58:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:36,555 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:58:36,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:58:36,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970401898] [2024-10-24 11:58:36,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970401898] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:36,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:36,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-24 11:58:36,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830067683] [2024-10-24 11:58:36,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:36,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 11:58:36,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:58:36,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 11:58:36,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-10-24 11:58:36,558 INFO L87 Difference]: Start difference. First operand 767 states and 1092 transitions. Second operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:37,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:37,238 INFO L93 Difference]: Finished difference Result 1828 states and 2588 transitions. [2024-10-24 11:58:37,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 11:58:37,239 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 100 [2024-10-24 11:58:37,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:37,243 INFO L225 Difference]: With dead ends: 1828 [2024-10-24 11:58:37,243 INFO L226 Difference]: Without dead ends: 1107 [2024-10-24 11:58:37,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2024-10-24 11:58:37,245 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 352 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1474 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:37,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 1474 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:58:37,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2024-10-24 11:58:37,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 746. [2024-10-24 11:58:37,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 704 states have (on average 1.4105113636363635) internal successors, (993), 704 states have internal predecessors, (993), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 11:58:37,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1065 transitions. [2024-10-24 11:58:37,284 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1065 transitions. Word has length 100 [2024-10-24 11:58:37,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:37,284 INFO L471 AbstractCegarLoop]: Abstraction has 746 states and 1065 transitions. [2024-10-24 11:58:37,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:37,284 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1065 transitions. [2024-10-24 11:58:37,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 11:58:37,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:37,286 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:58:37,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-24 11:58:37,287 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:37,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:37,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1198182934, now seen corresponding path program 1 times [2024-10-24 11:58:37,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:58:37,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092719334] [2024-10-24 11:58:37,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:37,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:58:37,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:37,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:58:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:37,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:58:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:37,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:58:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:37,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:58:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:37,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:58:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:37,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:58:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:37,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:58:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:37,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:58:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:37,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:58:37,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:37,725 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:58:37,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:58:37,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092719334] [2024-10-24 11:58:37,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092719334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:37,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:37,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:58:37,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481039998] [2024-10-24 11:58:37,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:37,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:58:37,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:58:37,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:58:37,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:58:37,728 INFO L87 Difference]: Start difference. First operand 746 states and 1065 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:58:38,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:38,166 INFO L93 Difference]: Finished difference Result 1499 states and 2141 transitions. [2024-10-24 11:58:38,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:58:38,166 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 100 [2024-10-24 11:58:38,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:38,169 INFO L225 Difference]: With dead ends: 1499 [2024-10-24 11:58:38,169 INFO L226 Difference]: Without dead ends: 799 [2024-10-24 11:58:38,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:58:38,170 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 291 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:38,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 697 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:58:38,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2024-10-24 11:58:38,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 642. [2024-10-24 11:58:38,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 600 states have (on average 1.3983333333333334) internal successors, (839), 600 states have internal predecessors, (839), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 11:58:38,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 911 transitions. [2024-10-24 11:58:38,232 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 911 transitions. Word has length 100 [2024-10-24 11:58:38,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:38,232 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 911 transitions. [2024-10-24 11:58:38,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:58:38,232 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 911 transitions. [2024-10-24 11:58:38,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 11:58:38,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:38,233 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:58:38,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-24 11:58:38,234 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:38,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:38,234 INFO L85 PathProgramCache]: Analyzing trace with hash 170351508, now seen corresponding path program 1 times [2024-10-24 11:58:38,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:58:38,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544696321] [2024-10-24 11:58:38,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:38,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:58:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:38,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:58:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:38,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:58:38,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:38,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:58:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:38,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:58:38,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:38,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:58:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:38,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:58:38,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:38,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:58:38,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:38,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:58:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:38,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:58:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:38,816 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:58:38,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:58:38,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544696321] [2024-10-24 11:58:38,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544696321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:38,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:38,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-24 11:58:38,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963621644] [2024-10-24 11:58:38,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:38,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 11:58:38,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:58:38,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 11:58:38,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:58:38,820 INFO L87 Difference]: Start difference. First operand 642 states and 911 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:39,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:39,486 INFO L93 Difference]: Finished difference Result 1997 states and 2777 transitions. [2024-10-24 11:58:39,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 11:58:39,486 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 100 [2024-10-24 11:58:39,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:39,491 INFO L225 Difference]: With dead ends: 1997 [2024-10-24 11:58:39,491 INFO L226 Difference]: Without dead ends: 1401 [2024-10-24 11:58:39,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2024-10-24 11:58:39,494 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 547 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:39,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 1293 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:58:39,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2024-10-24 11:58:39,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 642. [2024-10-24 11:58:39,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 600 states have (on average 1.3983333333333334) internal successors, (839), 600 states have internal predecessors, (839), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 11:58:39,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 911 transitions. [2024-10-24 11:58:39,546 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 911 transitions. Word has length 100 [2024-10-24 11:58:39,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:39,547 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 911 transitions. [2024-10-24 11:58:39,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:39,548 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 911 transitions. [2024-10-24 11:58:39,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 11:58:39,548 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:39,549 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:58:39,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-24 11:58:39,549 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:39,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:39,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1078160643, now seen corresponding path program 1 times [2024-10-24 11:58:39,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:58:39,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673934774] [2024-10-24 11:58:39,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:39,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:58:39,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:41,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:58:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:41,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:58:41,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:41,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:58:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:41,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:58:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:41,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:58:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:41,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:58:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:41,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:58:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:41,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:58:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:41,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:58:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:41,356 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:58:41,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:58:41,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673934774] [2024-10-24 11:58:41,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673934774] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:41,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:41,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-24 11:58:41,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903947004] [2024-10-24 11:58:41,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:41,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 11:58:41,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:58:41,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 11:58:41,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:58:41,362 INFO L87 Difference]: Start difference. First operand 642 states and 911 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-24 11:58:42,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:42,021 INFO L93 Difference]: Finished difference Result 650 states and 919 transitions. [2024-10-24 11:58:42,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:58:42,021 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 101 [2024-10-24 11:58:42,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:42,024 INFO L225 Difference]: With dead ends: 650 [2024-10-24 11:58:42,024 INFO L226 Difference]: Without dead ends: 648 [2024-10-24 11:58:42,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-10-24 11:58:42,025 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 472 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:42,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 698 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:58:42,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2024-10-24 11:58:42,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 644. [2024-10-24 11:58:42,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 602 states have (on average 1.3970099667774087) internal successors, (841), 602 states have internal predecessors, (841), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 11:58:42,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 913 transitions. [2024-10-24 11:58:42,156 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 913 transitions. Word has length 101 [2024-10-24 11:58:42,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:42,157 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 913 transitions. [2024-10-24 11:58:42,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-24 11:58:42,157 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 913 transitions. [2024-10-24 11:58:42,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 11:58:42,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:42,158 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:58:42,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-24 11:58:42,159 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:42,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:42,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1078101061, now seen corresponding path program 1 times [2024-10-24 11:58:42,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:58:42,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707234436] [2024-10-24 11:58:42,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:42,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:58:42,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:58:42,225 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:58:42,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:58:42,341 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:58:42,342 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:58:42,343 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:58:42,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-24 11:58:42,348 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:58:42,466 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:58:42,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:58:42 BoogieIcfgContainer [2024-10-24 11:58:42,469 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:58:42,469 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:58:42,469 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:58:42,470 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:58:42,470 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:57:55" (3/4) ... [2024-10-24 11:58:42,471 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:58:42,473 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:58:42,473 INFO L158 Benchmark]: Toolchain (without parser) took 48038.30ms. Allocated memory was 178.3MB in the beginning and 1.1GB in the end (delta: 874.5MB). Free memory was 120.8MB in the beginning and 698.6MB in the end (delta: -577.8MB). Peak memory consumption was 298.6MB. Max. memory is 16.1GB. [2024-10-24 11:58:42,473 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 178.3MB. Free memory is still 141.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:58:42,473 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.78ms. Allocated memory is still 178.3MB. Free memory was 120.4MB in the beginning and 104.0MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 11:58:42,473 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.57ms. Allocated memory is still 178.3MB. Free memory was 104.0MB in the beginning and 99.4MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:58:42,474 INFO L158 Benchmark]: Boogie Preprocessor took 73.44ms. Allocated memory is still 178.3MB. Free memory was 99.4MB in the beginning and 94.8MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:58:42,474 INFO L158 Benchmark]: RCFGBuilder took 805.03ms. Allocated memory is still 178.3MB. Free memory was 94.8MB in the beginning and 54.1MB in the end (delta: 40.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-10-24 11:58:42,474 INFO L158 Benchmark]: TraceAbstraction took 46735.41ms. Allocated memory was 178.3MB in the beginning and 1.1GB in the end (delta: 874.5MB). Free memory was 53.7MB in the beginning and 699.7MB in the end (delta: -646.0MB). Peak memory consumption was 229.4MB. Max. memory is 16.1GB. [2024-10-24 11:58:42,474 INFO L158 Benchmark]: Witness Printer took 3.22ms. Allocated memory is still 1.1GB. Free memory was 699.7MB in the beginning and 698.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 11:58:42,475 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.16ms. Allocated memory is still 178.3MB. Free memory is still 141.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.78ms. Allocated memory is still 178.3MB. Free memory was 120.4MB in the beginning and 104.0MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.57ms. Allocated memory is still 178.3MB. Free memory was 104.0MB in the beginning and 99.4MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.44ms. Allocated memory is still 178.3MB. Free memory was 99.4MB in the beginning and 94.8MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 805.03ms. Allocated memory is still 178.3MB. Free memory was 94.8MB in the beginning and 54.1MB in the end (delta: 40.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 46735.41ms. Allocated memory was 178.3MB in the beginning and 1.1GB in the end (delta: 874.5MB). Free memory was 53.7MB in the beginning and 699.7MB in the end (delta: -646.0MB). Peak memory consumption was 229.4MB. Max. memory is 16.1GB. * Witness Printer took 3.22ms. Allocated memory is still 1.1GB. Free memory was 699.7MB in the beginning and 698.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 113, overapproximation of someUnaryDOUBLEoperation at line 43. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -10, 4, 200, 32, 256.5, -0.25, 0.30000000000000004, 49.5, -8, 0, 0.4, -256 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -10, 4, 200, 32, 256.5, -0.25, 0.30000000000000004, 49.5, -8, 0, 0.4, -256 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -10, 4, 200, 32, 256.5, -0.25, 0.30000000000000004, 49.5, -8, 0, 0.4, -256 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -10, 4, 200, 32, 256.5, -0.25, 0.30000000000000004, 49.5, -8, 0, 0.4, -256 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -10, 4, 200, 32, 256.5, -0.25, 0.30000000000000004, 49.5, -8, 0, 0.4, -256 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -10, 4, 200, 32, 256.5, -0.25, 0.30000000000000004, 49.5, -8, 0, 0.4, -256 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -10, 4, 200, 32, 256.5, -0.25, 0.30000000000000004, 49.5, -8, 0, 0.4, -256 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -10, 4, 200, 32, 256.5, -0.25, 0.30000000000000004, 49.5, -8, 0, 0.4, -256 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -10, 4, 200, 32, 256.5, -0.25, 0.30000000000000004, 49.5, -8, 0, 0.4, -256 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -10, 4, 200, 32, 256.5, -0.25, 0.30000000000000004, 49.5, -8, 0, 0.4, -256 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -10, 4, 200, 32, 256.5, -0.25, 0.30000000000000004, 49.5, -8, 0, 0.4, -256 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -10, 4, 200, 32, 256.5, -0.25, 0.30000000000000004, 49.5, -8, 0, 0.4, -256 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -10, 4, 200, 32, 256.5, -0.25, 0.30000000000000004, 49.5, -8, 0, 0.4, -256 }; [L51] signed short int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L52] signed short int* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L53] unsigned char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L54] unsigned char* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L55] float* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L56] float* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L57] float* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L58] float* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L59] signed long int* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L60] unsigned char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L61] float* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L62] signed long int* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L63] signed long int last_1_WrapperStruct00_var_1_13 = -8; [L117] isInitial = 1 [L118] FCALL initially() [L119] COND TRUE 1 [L120] CALL updateLastVariables() [L110] EXPR WrapperStruct00.var_1_13 [L110] last_1_WrapperStruct00_var_1_13 = WrapperStruct00.var_1_13 [L120] RET updateLastVariables() [L121] CALL updateVariables() [L93] WrapperStruct00.var_1_5 = __VERIFIER_nondet_short() [L94] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L95] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L96] WrapperStruct00.var_1_8 = __VERIFIER_nondet_uchar() [L97] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L98] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L99] WrapperStruct00.var_1_10 = __VERIFIER_nondet_float() [L100] EXPR WrapperStruct00.var_1_10 [L100] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L100] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L100] EXPR WrapperStruct00.var_1_10 [L100] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L100] EXPR (WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L100] EXPR (WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L100] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L100] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] WrapperStruct00.var_1_11 = __VERIFIER_nondet_float() [L102] EXPR WrapperStruct00.var_1_11 [L102] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L102] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F [L102] EXPR WrapperStruct00.var_1_11 [L102] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L102] EXPR (WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L102] EXPR (WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L102] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L102] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L103] WrapperStruct00.var_1_12 = __VERIFIER_nondet_float() [L104] EXPR WrapperStruct00.var_1_12 [L104] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L104] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F [L104] EXPR WrapperStruct00.var_1_12 [L104] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L104] EXPR (WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L104] EXPR (WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L104] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L104] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L105] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L107] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L121] RET updateVariables() [L122] CALL step() [L67] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L67] COND FALSE !((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) [L70] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L70] (*(WrapperStruct00_var_1_16_Pointer)) = (*(WrapperStruct00_var_1_7_Pointer)) [L71] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L71] unsigned char stepLocal_1 = (*(WrapperStruct00_var_1_7_Pointer)); [L72] EXPR \read(*WrapperStruct00_var_1_14_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L72] COND TRUE ! (*(WrapperStruct00_var_1_14_Pointer)) [L73] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L73] (*(WrapperStruct00_var_1_13_Pointer)) = (*(WrapperStruct00_var_1_8_Pointer)) [L81] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L81] (*(WrapperStruct00_var_1_15_Pointer)) = (*(WrapperStruct00_var_1_11_Pointer)) [L82] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L82] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L82] EXPR (*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_1=200] [L82] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L82] signed long int stepLocal_0 = ((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer)); [L83] COND FALSE !(stepLocal_0 < -1) [L86] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L86] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L86] (*(WrapperStruct00_var_1_1_Pointer)) = (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) [L88] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_16_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L88] EXPR (*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_1=200] [L88] EXPR (*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_1=200] [L88] COND FALSE !((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) [L122] RET step() [L123] CALL, EXPR property() [L113] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L113] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR \read(*WrapperStruct00_var_1_16_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR ((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))))) [L113] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L113] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L113] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L113] EXPR ((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1) [L113] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR ((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1 [L113] EXPR ((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR ((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR ((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1) [L113] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L113] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L113] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L113] EXPR \read(*WrapperStruct00_var_1_16_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR ((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1 [L113] EXPR ((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR ((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1)) && ((! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1)) && ((! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer)))))) [L113] EXPR \read(*WrapperStruct00_var_1_14_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer))))) [L113] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L113] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L113] EXPR (! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1)) && ((! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR ((((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1)) && ((! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_11_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR ((((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1)) && ((! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_11_Pointer)))) [L113] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L113] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L113] EXPR ((((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1)) && ((! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_11_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (((((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1)) && ((! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_11_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (((((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1)) && ((! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_11_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113-L114] return (((((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1)) && ((! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_11_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) ; [L123] RET, EXPR property() [L123] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 46.5s, OverallIterations: 34, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 15.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8692 SdHoareTripleChecker+Valid, 10.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8689 mSDsluCounter, 25400 SdHoareTripleChecker+Invalid, 8.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20867 mSDsCounter, 324 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14886 IncrementalHoareTripleChecker+Invalid, 15210 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 324 mSolverCounterUnsat, 4533 mSDtfsCounter, 14886 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1253 GetRequests, 826 SyntacticMatches, 9 SemanticMatches, 418 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=794occurred in iteration=28, InterpolantAutomatonStates: 289, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 33 MinimizatonAttempts, 5124 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 27.7s InterpolantComputationTime, 3384 NumberOfCodeBlocks, 3384 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 3249 ConstructedInterpolants, 0 QuantifiedInterpolants, 29375 SizeOfPredicates, 7 NumberOfNonLiveVariables, 380 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 34 InterpolantComputations, 32 PerfectInterpolantSequences, 4798/4896 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 11:58:42,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-33.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 9fba8bcd82b4a3fe57500a406293d5d51cfc2c8d1877a7a6552e09538ec18fb3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:58:44,684 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:58:44,770 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:58:44,776 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:58:44,778 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:58:44,811 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:58:44,813 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:58:44,813 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:58:44,814 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:58:44,815 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:58:44,816 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:58:44,816 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:58:44,817 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:58:44,817 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:58:44,817 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:58:44,818 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:58:44,818 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:58:44,819 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:58:44,819 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:58:44,820 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:58:44,820 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:58:44,821 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:58:44,822 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:58:44,822 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:58:44,822 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:58:44,822 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:58:44,823 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:58:44,823 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:58:44,823 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:58:44,824 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:58:44,824 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:58:44,824 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:58:44,825 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:58:44,825 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:58:44,826 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:58:44,826 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:58:44,827 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:58:44,827 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:58:44,827 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:58:44,827 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:58:44,828 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:58:44,828 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:58:44,828 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:58:44,828 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:58:44,829 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:58:44,829 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 -> 9fba8bcd82b4a3fe57500a406293d5d51cfc2c8d1877a7a6552e09538ec18fb3 [2024-10-24 11:58:45,164 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:58:45,187 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:58:45,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:58:45,191 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:58:45,191 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:58:45,193 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-33.i [2024-10-24 11:58:46,687 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:58:46,906 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:58:46,907 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-33.i [2024-10-24 11:58:46,923 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00617b745/f5560f0cfa234f84aa3a70d6a993ae01/FLAG291b5051f [2024-10-24 11:58:47,273 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00617b745/f5560f0cfa234f84aa3a70d6a993ae01 [2024-10-24 11:58:47,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:58:47,278 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:58:47,280 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:58:47,280 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:58:47,285 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:58:47,286 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:58:47" (1/1) ... [2024-10-24 11:58:47,287 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55bbfd7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:58:47, skipping insertion in model container [2024-10-24 11:58:47,288 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:58:47" (1/1) ... [2024-10-24 11:58:47,320 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:58:47,508 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-33.i[917,930] [2024-10-24 11:58:47,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:58:47,625 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:58:47,635 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-33.i[917,930] [2024-10-24 11:58:47,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:58:47,710 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:58:47,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:58:47 WrapperNode [2024-10-24 11:58:47,710 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:58:47,712 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:58:47,712 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:58:47,712 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:58:47,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:58:47" (1/1) ... [2024-10-24 11:58:47,739 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:58:47" (1/1) ... [2024-10-24 11:58:47,787 INFO L138 Inliner]: procedures = 36, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 418 [2024-10-24 11:58:47,787 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:58:47,788 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:58:47,792 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:58:47,792 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:58:47,803 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:58:47" (1/1) ... [2024-10-24 11:58:47,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:58:47" (1/1) ... [2024-10-24 11:58:47,815 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:58:47" (1/1) ... [2024-10-24 11:58:47,848 INFO L175 MemorySlicer]: Split 115 memory accesses to 2 slices as follows [2, 113]. 98 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 15 writes are split as follows [0, 15]. [2024-10-24 11:58:47,849 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:58:47" (1/1) ... [2024-10-24 11:58:47,849 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:58:47" (1/1) ... [2024-10-24 11:58:47,871 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:58:47" (1/1) ... [2024-10-24 11:58:47,881 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:58:47" (1/1) ... [2024-10-24 11:58:47,884 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:58:47" (1/1) ... [2024-10-24 11:58:47,890 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:58:47" (1/1) ... [2024-10-24 11:58:47,896 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:58:47,897 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:58:47,897 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:58:47,897 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:58:47,899 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:58:47" (1/1) ... [2024-10-24 11:58:47,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:58:47,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:58:47,929 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:58:47,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:58:47,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:58:47,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 11:58:47,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 11:58:47,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-24 11:58:47,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-24 11:58:47,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:58:47,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 11:58:47,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-24 11:58:47,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-24 11:58:47,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-24 11:58:47,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-24 11:58:47,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 11:58:47,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 11:58:47,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-24 11:58:47,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-24 11:58:47,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-24 11:58:47,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-24 11:58:47,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-24 11:58:47,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-24 11:58:47,977 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:58:47,978 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:58:47,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:58:47,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:58:47,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 11:58:47,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 11:58:47,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-24 11:58:47,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-24 11:58:47,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 11:58:47,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 11:58:48,106 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:58:48,108 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:58:49,637 INFO L? ?]: Removed 111 outVars from TransFormulas that were not future-live. [2024-10-24 11:58:49,637 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:58:49,710 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:58:49,710 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:58:49,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:58:49 BoogieIcfgContainer [2024-10-24 11:58:49,710 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:58:49,713 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:58:49,713 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:58:49,716 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:58:49,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:58:47" (1/3) ... [2024-10-24 11:58:49,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3252d154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:58:49, skipping insertion in model container [2024-10-24 11:58:49,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:58:47" (2/3) ... [2024-10-24 11:58:49,717 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3252d154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:58:49, skipping insertion in model container [2024-10-24 11:58:49,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:58:49" (3/3) ... [2024-10-24 11:58:49,719 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-33.i [2024-10-24 11:58:49,734 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:58:49,734 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:58:49,790 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:58:49,796 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;@10be71bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:58:49,796 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:58:49,800 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 67 states have internal predecessors, (97), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:58:49,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-24 11:58:49,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:49,810 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:58:49,810 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:49,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:49,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1197567767, now seen corresponding path program 1 times [2024-10-24 11:58:49,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:58:49,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096152323] [2024-10-24 11:58:49,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:49,825 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:58:49,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:58:49,827 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:58:49,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 11:58:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:50,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:58:50,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:58:50,126 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-10-24 11:58:50,126 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:58:50,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:58:50,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2096152323] [2024-10-24 11:58:50,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2096152323] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:50,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:50,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:58:50,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364393022] [2024-10-24 11:58:50,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:50,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:58:50,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:58:50,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:58:50,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:58:50,164 INFO L87 Difference]: Start difference. First operand has 78 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 67 states have internal predecessors, (97), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:50,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:50,234 INFO L93 Difference]: Finished difference Result 153 states and 237 transitions. [2024-10-24 11:58:50,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:58:50,238 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 87 [2024-10-24 11:58:50,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:50,246 INFO L225 Difference]: With dead ends: 153 [2024-10-24 11:58:50,247 INFO L226 Difference]: Without dead ends: 76 [2024-10-24 11:58:50,251 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-10-24 11:58:50,255 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:50,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:58:50,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-24 11:58:50,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-24 11:58:50,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.4153846153846155) internal successors, (92), 65 states have internal predecessors, (92), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:58:50,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 110 transitions. [2024-10-24 11:58:50,305 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 110 transitions. Word has length 87 [2024-10-24 11:58:50,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:50,307 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 110 transitions. [2024-10-24 11:58:50,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:50,307 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 110 transitions. [2024-10-24 11:58:50,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-24 11:58:50,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:50,313 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:58:50,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 11:58:50,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:58:50,514 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:50,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:50,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1109014631, now seen corresponding path program 1 times [2024-10-24 11:58:50,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:58:50,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [981364771] [2024-10-24 11:58:50,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:50,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:58:50,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:58:50,520 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:58:50,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 11:58:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:50,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:58:50,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:58:50,873 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-24 11:58:50,874 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:58:50,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:58:50,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [981364771] [2024-10-24 11:58:50,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [981364771] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:50,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:50,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:58:50,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520746149] [2024-10-24 11:58:50,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:50,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:58:50,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:58:50,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:58:50,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:58:50,878 INFO L87 Difference]: Start difference. First operand 76 states and 110 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:58:50,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:50,955 INFO L93 Difference]: Finished difference Result 153 states and 222 transitions. [2024-10-24 11:58:50,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:58:50,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 87 [2024-10-24 11:58:50,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:50,959 INFO L225 Difference]: With dead ends: 153 [2024-10-24 11:58:50,959 INFO L226 Difference]: Without dead ends: 78 [2024-10-24 11:58:50,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:58:50,961 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:50,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 305 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:58:50,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-24 11:58:50,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-24 11:58:50,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 67 states have (on average 1.4029850746268657) internal successors, (94), 67 states have internal predecessors, (94), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:58:50,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 112 transitions. [2024-10-24 11:58:50,970 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 112 transitions. Word has length 87 [2024-10-24 11:58:50,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:50,973 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 112 transitions. [2024-10-24 11:58:50,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:58:50,973 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 112 transitions. [2024-10-24 11:58:50,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-24 11:58:50,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:50,977 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:58:50,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 11:58:51,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:58:51,180 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:51,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:51,180 INFO L85 PathProgramCache]: Analyzing trace with hash -211621353, now seen corresponding path program 1 times [2024-10-24 11:58:51,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:58:51,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1960984481] [2024-10-24 11:58:51,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:51,181 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:58:51,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:58:51,183 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:58:51,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 11:58:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:51,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:58:51,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:58:51,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-10-24 11:58:51,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2024-10-24 11:58:51,698 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:58:51,700 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:58:51,700 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:58:51,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1960984481] [2024-10-24 11:58:51,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1960984481] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:51,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:51,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:58:51,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624393617] [2024-10-24 11:58:51,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:51,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:58:51,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:58:51,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:58:51,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:58:51,706 INFO L87 Difference]: Start difference. First operand 78 states and 112 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:57,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:57,380 INFO L93 Difference]: Finished difference Result 189 states and 271 transitions. [2024-10-24 11:58:57,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:58:57,381 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 87 [2024-10-24 11:58:57,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:57,383 INFO L225 Difference]: With dead ends: 189 [2024-10-24 11:58:57,384 INFO L226 Difference]: Without dead ends: 112 [2024-10-24 11:58:57,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:58:57,386 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 42 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:57,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 308 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-10-24 11:58:57,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-24 11:58:57,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 84. [2024-10-24 11:58:57,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 73 states have internal predecessors, (102), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:58:57,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 120 transitions. [2024-10-24 11:58:57,395 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 120 transitions. Word has length 87 [2024-10-24 11:58:57,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:57,396 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 120 transitions. [2024-10-24 11:58:57,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:57,396 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 120 transitions. [2024-10-24 11:58:57,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-24 11:58:57,397 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:57,397 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:58:57,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-24 11:58:57,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:58:57,599 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:57,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:57,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1222738603, now seen corresponding path program 1 times [2024-10-24 11:58:57,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:58:57,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [494871397] [2024-10-24 11:58:57,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:57,601 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:58:57,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:58:57,606 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:58:57,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 11:58:57,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:57,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 11:58:57,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:58:57,895 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:58:57,896 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:58:57,896 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:58:57,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [494871397] [2024-10-24 11:58:57,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [494871397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:57,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:57,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:58:57,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569255922] [2024-10-24 11:58:57,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:57,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:58:57,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:58:57,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:58:57,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:58:57,898 INFO L87 Difference]: Start difference. First operand 84 states and 120 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:57,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:57,985 INFO L93 Difference]: Finished difference Result 174 states and 249 transitions. [2024-10-24 11:58:57,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:58:57,986 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 87 [2024-10-24 11:58:57,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:57,990 INFO L225 Difference]: With dead ends: 174 [2024-10-24 11:58:57,990 INFO L226 Difference]: Without dead ends: 91 [2024-10-24 11:58:57,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:58:57,991 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 1 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:57,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 482 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:58:57,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-24 11:58:58,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-10-24 11:58:58,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.3670886075949367) internal successors, (108), 79 states have internal predecessors, (108), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:58:58,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 126 transitions. [2024-10-24 11:58:58,005 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 126 transitions. Word has length 87 [2024-10-24 11:58:58,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:58,005 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 126 transitions. [2024-10-24 11:58:58,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:58:58,006 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 126 transitions. [2024-10-24 11:58:58,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-24 11:58:58,006 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:58,006 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:58:58,021 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 (5)] Ended with exit code 0 [2024-10-24 11:58:58,207 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-10-24 11:58:58,207 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:58,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:58,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1165480301, now seen corresponding path program 1 times [2024-10-24 11:58:58,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:58:58,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [962754203] [2024-10-24 11:58:58,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:58,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:58:58,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:58:58,212 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:58:58,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 11:58:58,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:58,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 11:58:58,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:58:58,510 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:58:58,513 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:58:58,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:58:58,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [962754203] [2024-10-24 11:58:58,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [962754203] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:58,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:58,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:58:58,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296775094] [2024-10-24 11:58:58,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:58,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:58:58,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:58:58,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:58:58,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:58:58,516 INFO L87 Difference]: Start difference. First operand 90 states and 126 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9)