./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-s_file-49.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-s_file-49.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 06bb6f3bbb0c6ee3bc73b3f1732ad2bc217c179634d5fa3dbf744e010ef897a1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:48:54,819 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:48:54,890 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:48:54,896 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:48:54,897 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:48:54,927 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:48:54,928 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:48:54,928 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:48:54,929 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:48:54,931 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:48:54,931 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:48:54,943 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:48:54,944 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:48:54,946 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:48:54,946 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:48:54,947 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:48:54,947 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:48:54,947 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:48:54,947 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:48:54,948 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:48:54,948 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:48:54,951 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:48:54,951 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:48:54,951 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:48:54,952 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:48:54,952 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:48:54,952 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:48:54,952 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:48:54,952 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:48:54,953 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:48:54,953 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:48:54,953 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:48:54,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:48:54,953 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:48:54,954 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:48:54,954 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:48:54,954 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:48:54,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:48:54,956 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:48:54,956 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:48:54,956 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:48:54,957 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:48:54,957 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 -> 06bb6f3bbb0c6ee3bc73b3f1732ad2bc217c179634d5fa3dbf744e010ef897a1 [2024-10-24 11:48:55,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:48:55,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:48:55,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:48:55,239 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:48:55,240 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:48:55,241 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-49.i [2024-10-24 11:48:56,650 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:48:56,831 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:48:56,832 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-49.i [2024-10-24 11:48:56,840 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abb454d90/9ac0ec93ed53438eafa842079f9205c4/FLAG0320c708f [2024-10-24 11:48:56,856 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abb454d90/9ac0ec93ed53438eafa842079f9205c4 [2024-10-24 11:48:56,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:48:56,859 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:48:56,861 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:48:56,861 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:48:56,868 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:48:56,869 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:48:56" (1/1) ... [2024-10-24 11:48:56,882 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@753ad140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:56, skipping insertion in model container [2024-10-24 11:48:56,882 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:48:56" (1/1) ... [2024-10-24 11:48:56,918 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:48:57,097 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-s_file-49.i[916,929] [2024-10-24 11:48:57,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:48:57,179 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:48:57,195 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-s_file-49.i[916,929] [2024-10-24 11:48:57,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:48:57,280 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:48:57,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:57 WrapperNode [2024-10-24 11:48:57,281 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:48:57,282 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:48:57,282 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:48:57,282 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:48:57,289 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:48:57" (1/1) ... [2024-10-24 11:48:57,309 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:48:57" (1/1) ... [2024-10-24 11:48:57,377 INFO L138 Inliner]: procedures = 29, calls = 192, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 656 [2024-10-24 11:48:57,383 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:48:57,384 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:48:57,384 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:48:57,384 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:48:57,395 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:57" (1/1) ... [2024-10-24 11:48:57,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:57" (1/1) ... [2024-10-24 11:48:57,410 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:57" (1/1) ... [2024-10-24 11:48:57,445 INFO L175 MemorySlicer]: Split 166 memory accesses to 2 slices as follows [2, 164]. 99 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 17 writes are split as follows [0, 17]. [2024-10-24 11:48:57,449 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:57" (1/1) ... [2024-10-24 11:48:57,449 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:57" (1/1) ... [2024-10-24 11:48:57,482 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:57" (1/1) ... [2024-10-24 11:48:57,494 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:57" (1/1) ... [2024-10-24 11:48:57,501 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:57" (1/1) ... [2024-10-24 11:48:57,507 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:57" (1/1) ... [2024-10-24 11:48:57,513 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:48:57,514 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:48:57,514 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:48:57,514 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:48:57,515 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:57" (1/1) ... [2024-10-24 11:48:57,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:48:57,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:48:57,554 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:48:57,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:48:57,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:48:57,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:48:57,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:48:57,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:48:57,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:48:57,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:48:57,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:48:57,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:48:57,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:48:57,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:48:57,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:48:57,603 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:48:57,603 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:48:57,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:48:57,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:48:57,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:48:57,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:48:57,727 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:48:57,729 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:48:58,328 INFO L? ?]: Removed 216 outVars from TransFormulas that were not future-live. [2024-10-24 11:48:58,328 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:48:58,384 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:48:58,402 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:48:58,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:48:58 BoogieIcfgContainer [2024-10-24 11:48:58,402 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:48:58,405 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:48:58,408 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:48:58,411 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:48:58,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:48:56" (1/3) ... [2024-10-24 11:48:58,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@625b0f07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:48:58, skipping insertion in model container [2024-10-24 11:48:58,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:57" (2/3) ... [2024-10-24 11:48:58,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@625b0f07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:48:58, skipping insertion in model container [2024-10-24 11:48:58,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:48:58" (3/3) ... [2024-10-24 11:48:58,418 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-49.i [2024-10-24 11:48:58,434 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:48:58,435 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:48:58,503 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:48:58,509 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;@1ca41192, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:48:58,509 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:48:58,514 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 112 states have (on average 1.5) internal successors, (168), 113 states have internal predecessors, (168), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:48:58,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-24 11:48:58,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:58,530 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:58,531 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:58,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:58,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1091786376, now seen corresponding path program 1 times [2024-10-24 11:48:58,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:48:58,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300344502] [2024-10-24 11:48:58,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:58,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:48:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:58,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:48:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:58,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:48:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:58,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:48:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:58,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:48:58,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:58,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:48:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:58,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:48:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:58,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:48:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:58,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:48:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:58,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:48:58,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:58,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:48:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:58,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:48:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:58,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:48:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:58,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:48:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:58,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:48:58,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:58,877 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:48:58,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:48:58,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300344502] [2024-10-24 11:48:58,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300344502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:48:58,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:48:58,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:48:58,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607318122] [2024-10-24 11:48:58,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:48:58,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:48:58,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:48:58,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:48:58,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:48:58,908 INFO L87 Difference]: Start difference. First operand has 129 states, 112 states have (on average 1.5) internal successors, (168), 113 states have internal predecessors, (168), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:48:58,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:48:58,951 INFO L93 Difference]: Finished difference Result 255 states and 404 transitions. [2024-10-24 11:48:58,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:48:58,954 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 112 [2024-10-24 11:48:58,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:48:58,964 INFO L225 Difference]: With dead ends: 255 [2024-10-24 11:48:58,964 INFO L226 Difference]: Without dead ends: 127 [2024-10-24 11:48:58,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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:48:58,972 INFO L432 NwaCegarLoop]: 187 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, 187 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:48:58,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 187 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:48:58,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-24 11:48:59,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-10-24 11:48:59,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 111 states have (on average 1.4684684684684686) internal successors, (163), 111 states have internal predecessors, (163), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:48:59,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 191 transitions. [2024-10-24 11:48:59,023 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 191 transitions. Word has length 112 [2024-10-24 11:48:59,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:48:59,024 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 191 transitions. [2024-10-24 11:48:59,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:48:59,024 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 191 transitions. [2024-10-24 11:48:59,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-24 11:48:59,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:59,027 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:59,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:48:59,028 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:59,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:59,029 INFO L85 PathProgramCache]: Analyzing trace with hash 911226656, now seen corresponding path program 1 times [2024-10-24 11:48:59,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:48:59,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764923713] [2024-10-24 11:48:59,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:59,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:48:59,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:59,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:48:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:59,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:48:59,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:59,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:48:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:59,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:48:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:59,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:48:59,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:59,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:48:59,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:59,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:48:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:59,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:48:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:59,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:48:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:59,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:48:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:59,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:48:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:59,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:48:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:59,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:48:59,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:59,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:48:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:59,833 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:48:59,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:48:59,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764923713] [2024-10-24 11:48:59,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764923713] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:48:59,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:48:59,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:48:59,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485887034] [2024-10-24 11:48:59,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:48:59,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:48:59,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:48:59,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:48:59,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:48:59,840 INFO L87 Difference]: Start difference. First operand 127 states and 191 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:49:00,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:49:00,390 INFO L93 Difference]: Finished difference Result 381 states and 574 transitions. [2024-10-24 11:49:00,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:49:00,392 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 112 [2024-10-24 11:49:00,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:49:00,395 INFO L225 Difference]: With dead ends: 381 [2024-10-24 11:49:00,397 INFO L226 Difference]: Without dead ends: 255 [2024-10-24 11:49:00,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:49:00,401 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 174 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:49:00,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 668 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:49:00,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-10-24 11:49:00,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 131. [2024-10-24 11:49:00,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 115 states have (on average 1.4608695652173913) internal successors, (168), 115 states have internal predecessors, (168), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:49:00,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 196 transitions. [2024-10-24 11:49:00,423 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 196 transitions. Word has length 112 [2024-10-24 11:49:00,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:49:00,425 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 196 transitions. [2024-10-24 11:49:00,425 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:49:00,426 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 196 transitions. [2024-10-24 11:49:00,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 11:49:00,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:49:00,431 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:00,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:49:00,431 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:49:00,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:49:00,432 INFO L85 PathProgramCache]: Analyzing trace with hash -647593691, now seen corresponding path program 1 times [2024-10-24 11:49:00,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:49:00,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572208235] [2024-10-24 11:49:00,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:00,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:49:00,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:01,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:49:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:01,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:49:01,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:01,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:49:01,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:01,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:49:01,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:01,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:49:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:01,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:49:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:01,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:49:01,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:01,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:49:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:01,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:49:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:01,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:49:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:01,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:49:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:01,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:49:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:01,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:49:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:01,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:49:01,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:01,137 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-24 11:49:01,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:49:01,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572208235] [2024-10-24 11:49:01,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572208235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:49:01,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:49:01,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:49:01,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246621943] [2024-10-24 11:49:01,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:49:01,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:49:01,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:49:01,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:49:01,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:49:01,139 INFO L87 Difference]: Start difference. First operand 131 states and 196 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:49:01,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:49:01,695 INFO L93 Difference]: Finished difference Result 269 states and 398 transitions. [2024-10-24 11:49:01,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 11:49:01,696 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2024-10-24 11:49:01,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:49:01,697 INFO L225 Difference]: With dead ends: 269 [2024-10-24 11:49:01,697 INFO L226 Difference]: Without dead ends: 139 [2024-10-24 11:49:01,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:49:01,701 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 153 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:49:01,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 292 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:49:01,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-24 11:49:01,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2024-10-24 11:49:01,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 118 states have (on average 1.4406779661016949) internal successors, (170), 118 states have internal predecessors, (170), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:49:01,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2024-10-24 11:49:01,726 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 198 transitions. Word has length 114 [2024-10-24 11:49:01,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:49:01,727 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 198 transitions. [2024-10-24 11:49:01,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:49:01,727 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 198 transitions. [2024-10-24 11:49:01,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 11:49:01,732 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:49:01,732 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:01,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:49:01,733 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:49:01,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:49:01,733 INFO L85 PathProgramCache]: Analyzing trace with hash -233049813, now seen corresponding path program 1 times [2024-10-24 11:49:01,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:49:01,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652906180] [2024-10-24 11:49:01,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:01,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:49:01,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:04,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:49:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:04,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:49:04,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:04,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:49:04,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:04,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:49:04,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:04,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:49:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:04,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:49:04,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:04,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:49:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:04,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:49:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:04,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:49:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:04,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:49:04,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:04,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:49:04,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:04,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:49:04,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:04,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:49:04,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:04,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:49:04,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:04,062 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:49:04,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:49:04,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652906180] [2024-10-24 11:49:04,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652906180] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:49:04,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:49:04,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-24 11:49:04,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627985721] [2024-10-24 11:49:04,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:49:04,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-24 11:49:04,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:49:04,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-24 11:49:04,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2024-10-24 11:49:04,066 INFO L87 Difference]: Start difference. First operand 135 states and 198 transitions. Second operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-24 11:49:06,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:49:06,341 INFO L93 Difference]: Finished difference Result 603 states and 893 transitions. [2024-10-24 11:49:06,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-24 11:49:06,342 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 116 [2024-10-24 11:49:06,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:49:06,345 INFO L225 Difference]: With dead ends: 603 [2024-10-24 11:49:06,345 INFO L226 Difference]: Without dead ends: 469 [2024-10-24 11:49:06,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=722, Unknown=0, NotChecked=0, Total=870 [2024-10-24 11:49:06,347 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 799 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 2312 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 2428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 2312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-24 11:49:06,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 1114 Invalid, 2428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 2312 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-24 11:49:06,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-10-24 11:49:06,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 305. [2024-10-24 11:49:06,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 279 states have (on average 1.4767025089605734) internal successors, (412), 280 states have internal predecessors, (412), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 11:49:06,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 456 transitions. [2024-10-24 11:49:06,379 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 456 transitions. Word has length 116 [2024-10-24 11:49:06,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:49:06,380 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 456 transitions. [2024-10-24 11:49:06,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-24 11:49:06,380 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 456 transitions. [2024-10-24 11:49:06,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 11:49:06,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:49:06,382 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:06,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:49:06,382 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:49:06,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:49:06,383 INFO L85 PathProgramCache]: Analyzing trace with hash 548721778, now seen corresponding path program 1 times [2024-10-24 11:49:06,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:49:06,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824760520] [2024-10-24 11:49:06,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:06,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:49:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:06,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:49:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:06,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:49:06,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:06,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:49:06,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:06,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:49:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:06,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:49:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:06,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:49:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:06,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:49:06,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:06,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:49:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:06,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:49:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:06,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:49:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:06,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:49:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:06,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:49:06,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:06,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:49:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:06,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:49:06,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:06,999 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 33 proven. 6 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-24 11:49:06,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:49:06,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824760520] [2024-10-24 11:49:07,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824760520] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:49:07,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973616632] [2024-10-24 11:49:07,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:07,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:49:07,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:49:07,004 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:49:07,005 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:49:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:07,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-24 11:49:07,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:49:07,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2024-10-24 11:49:07,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 63 treesize of output 49 [2024-10-24 11:49:07,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 75 [2024-10-24 11:49:07,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 32 [2024-10-24 11:49:07,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:07,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 48 [2024-10-24 11:49:07,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:07,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 57 [2024-10-24 11:49:07,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:07,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 36 [2024-10-24 11:49:07,715 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 123 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-10-24 11:49:07,716 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:49:07,966 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 33 proven. 6 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-24 11:49:07,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973616632] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:49:07,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 11:49:07,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 14 [2024-10-24 11:49:07,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400154996] [2024-10-24 11:49:07,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 11:49:07,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 11:49:07,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:49:07,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 11:49:07,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:49:07,969 INFO L87 Difference]: Start difference. First operand 305 states and 456 transitions. Second operand has 14 states, 11 states have (on average 6.454545454545454) internal successors, (71), 14 states have internal predecessors, (71), 5 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 5 states have call successors, (18) [2024-10-24 11:49:09,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:49:09,470 INFO L93 Difference]: Finished difference Result 885 states and 1308 transitions. [2024-10-24 11:49:09,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-24 11:49:09,474 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 6.454545454545454) internal successors, (71), 14 states have internal predecessors, (71), 5 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 5 states have call successors, (18) Word has length 116 [2024-10-24 11:49:09,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:49:09,478 INFO L225 Difference]: With dead ends: 885 [2024-10-24 11:49:09,478 INFO L226 Difference]: Without dead ends: 581 [2024-10-24 11:49:09,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 252 SyntacticMatches, 7 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=287, Invalid=973, Unknown=0, NotChecked=0, Total=1260 [2024-10-24 11:49:09,481 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 407 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 1490 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 1531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:49:09,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 586 Invalid, 1531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1490 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 11:49:09,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2024-10-24 11:49:09,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 317. [2024-10-24 11:49:09,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 290 states have (on average 1.4689655172413794) internal successors, (426), 291 states have internal predecessors, (426), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 11:49:09,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 470 transitions. [2024-10-24 11:49:09,505 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 470 transitions. Word has length 116 [2024-10-24 11:49:09,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:49:09,505 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 470 transitions. [2024-10-24 11:49:09,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 6.454545454545454) internal successors, (71), 14 states have internal predecessors, (71), 5 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 5 states have call successors, (18) [2024-10-24 11:49:09,506 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 470 transitions. [2024-10-24 11:49:09,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 11:49:09,507 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:49:09,507 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:09,527 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:49:09,708 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:49:09,709 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:49:09,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:49:09,709 INFO L85 PathProgramCache]: Analyzing trace with hash 806887216, now seen corresponding path program 1 times [2024-10-24 11:49:09,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:49:09,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857638667] [2024-10-24 11:49:09,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:09,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:49:09,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:49:09,748 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:49:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:49:09,837 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:49:09,837 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:49:09,838 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:49:09,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 11:49:09,844 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-24 11:49:09,903 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:49:09,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:49:09 BoogieIcfgContainer [2024-10-24 11:49:09,906 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:49:09,907 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:49:09,907 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:49:09,907 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:49:09,908 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:48:58" (3/4) ... [2024-10-24 11:49:09,909 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:49:09,911 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:49:09,911 INFO L158 Benchmark]: Toolchain (without parser) took 13051.85ms. Allocated memory was 134.2MB in the beginning and 352.3MB in the end (delta: 218.1MB). Free memory was 65.0MB in the beginning and 166.5MB in the end (delta: -101.6MB). Peak memory consumption was 118.2MB. Max. memory is 16.1GB. [2024-10-24 11:49:09,912 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 134.2MB. Free memory is still 100.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:49:09,912 INFO L158 Benchmark]: CACSL2BoogieTranslator took 420.39ms. Allocated memory was 134.2MB in the beginning and 188.7MB in the end (delta: 54.5MB). Free memory was 64.8MB in the beginning and 146.1MB in the end (delta: -81.3MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2024-10-24 11:49:09,912 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.23ms. Allocated memory is still 188.7MB. Free memory was 146.1MB in the beginning and 141.0MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:49:09,912 INFO L158 Benchmark]: Boogie Preprocessor took 129.40ms. Allocated memory is still 188.7MB. Free memory was 141.0MB in the beginning and 134.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 11:49:09,913 INFO L158 Benchmark]: RCFGBuilder took 888.80ms. Allocated memory is still 188.7MB. Free memory was 134.7MB in the beginning and 149.1MB in the end (delta: -14.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-10-24 11:49:09,913 INFO L158 Benchmark]: TraceAbstraction took 11501.88ms. Allocated memory was 188.7MB in the beginning and 352.3MB in the end (delta: 163.6MB). Free memory was 149.1MB in the beginning and 166.5MB in the end (delta: -17.4MB). Peak memory consumption was 146.2MB. Max. memory is 16.1GB. [2024-10-24 11:49:09,914 INFO L158 Benchmark]: Witness Printer took 3.79ms. Allocated memory is still 352.3MB. Free memory is still 166.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:49:09,915 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 134.2MB. Free memory is still 100.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 420.39ms. Allocated memory was 134.2MB in the beginning and 188.7MB in the end (delta: 54.5MB). Free memory was 64.8MB in the beginning and 146.1MB in the end (delta: -81.3MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 101.23ms. Allocated memory is still 188.7MB. Free memory was 146.1MB in the beginning and 141.0MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 129.40ms. Allocated memory is still 188.7MB. Free memory was 141.0MB in the beginning and 134.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 888.80ms. Allocated memory is still 188.7MB. Free memory was 134.7MB in the beginning and 149.1MB in the end (delta: -14.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 11501.88ms. Allocated memory was 188.7MB in the beginning and 352.3MB in the end (delta: 163.6MB). Free memory was 149.1MB in the beginning and 166.5MB in the end (delta: -17.4MB). Peak memory consumption was 146.2MB. Max. memory is 16.1GB. * Witness Printer took 3.79ms. Allocated memory is still 352.3MB. Free memory is still 166.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 108. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 4, 1000000000000000.4, 1000.2, 256, 4, 10, 128, -2, 0, 0, 0, 1 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 4, 1000000000000000.4, 1000.2, 256, 4, 10, 128, -2, 0, 0, 0, 1 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 4, 1000000000000000.4, 1000.2, 256, 4, 10, 128, -2, 0, 0, 0, 1 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 4, 1000000000000000.4, 1000.2, 256, 4, 10, 128, -2, 0, 0, 0, 1 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 4, 1000000000000000.4, 1000.2, 256, 4, 10, 128, -2, 0, 0, 0, 1 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 4, 1000000000000000.4, 1000.2, 256, 4, 10, 128, -2, 0, 0, 0, 1 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 4, 1000000000000000.4, 1000.2, 256, 4, 10, 128, -2, 0, 0, 0, 1 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 4, 1000000000000000.4, 1000.2, 256, 4, 10, 128, -2, 0, 0, 0, 1 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 4, 1000000000000000.4, 1000.2, 256, 4, 10, 128, -2, 0, 0, 0, 1 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 4, 1000000000000000.4, 1000.2, 256, 4, 10, 128, -2, 0, 0, 0, 1 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 4, 1000000000000000.4, 1000.2, 256, 4, 10, 128, -2, 0, 0, 0, 1 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 4, 1000000000000000.4, 1000.2, 256, 4, 10, 128, -2, 0, 0, 0, 1 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 4, 1000000000000000.4, 1000.2, 256, 4, 10, 128, -2, 0, 0, 0, 1 }; [L112] isInitial = 1 [L113] FCALL initially() [L114] COND TRUE 1 [L115] FCALL updateLastVariables() [L116] CALL updateVariables() [L82] WrapperStruct00.var_1_2 = __VERIFIER_nondet_float() [L83] EXPR WrapperStruct00.var_1_2 [L83] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L83] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F [L83] EXPR WrapperStruct00.var_1_2 [L83] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L83] EXPR (WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L83] EXPR (WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L83] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L83] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L84] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L85] EXPR WrapperStruct00.var_1_3 [L85] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L85] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L85] EXPR WrapperStruct00.var_1_3 [L85] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L85] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L85] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L85] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L85] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L86] WrapperStruct00.var_1_4 = __VERIFIER_nondet_ushort() [L87] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L88] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1] [L89] WrapperStruct00.var_1_5 = __VERIFIER_nondet_ushort() [L90] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1] [L92] WrapperStruct00.var_1_6 = __VERIFIER_nondet_ushort() [L93] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L94] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1] [L95] WrapperStruct00.var_1_9 = __VERIFIER_nondet_short() [L96] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= -32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= -32766) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L99] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L100] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L102] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L103] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L116] RET updateVariables() [L117] CALL step() [L54] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L54] EXPR ((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9) [L54] EXPR WrapperStruct00.var_1_9 [L54] EXPR ((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9) VAL [WrapperStruct00={4:0}, isInitial=1] [L54] WrapperStruct00.var_1_8 = ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) [L55] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L55] EXPR 50 >> WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L55] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L55] COND FALSE !((50 >> WrapperStruct00.var_1_4) <= WrapperStruct00.var_1_8) [L58] EXPR WrapperStruct00.var_1_11 [L58] WrapperStruct00.var_1_10 = (! WrapperStruct00.var_1_11) [L60] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L60] COND TRUE ! WrapperStruct00.var_1_12 [L61] EXPR WrapperStruct00.var_1_4 [L61] EXPR WrapperStruct00.var_1_6 [L61] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L61] EXPR ((WrapperStruct00.var_1_6) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_8) [L61] EXPR WrapperStruct00.var_1_6 [L61] EXPR ((WrapperStruct00.var_1_6) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_8) VAL [WrapperStruct00={4:0}, isInitial=1] [L61] COND FALSE !(WrapperStruct00.var_1_4 >= ((((WrapperStruct00.var_1_6) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_8)))) [L64] EXPR WrapperStruct00.var_1_11 [L64] WrapperStruct00.var_1_13 = WrapperStruct00.var_1_11 [L67] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L67] COND TRUE WrapperStruct00.var_1_2 >= 64.5f [L68] EXPR WrapperStruct00.var_1_2 [L68] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L68] COND FALSE !(WrapperStruct00.var_1_2 >= WrapperStruct00.var_1_3) [L71] WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L71] COND FALSE !(WrapperStruct00.var_1_13) [L74] EXPR WrapperStruct00.var_1_6 [L74] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_6 [L117] RET step() [L118] CALL, EXPR property() [L108] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L108] EXPR (WrapperStruct00.var_1_2 >= 64.5f) ? ((WrapperStruct00.var_1_2 >= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) < 0 ) ? -((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) : ((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))))))) : (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_1 == ((unsigned short int) 50)) [L108] EXPR WrapperStruct00.var_1_1 [L108] EXPR (WrapperStruct00.var_1_2 >= 64.5f) ? ((WrapperStruct00.var_1_2 >= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) < 0 ) ? -((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) : ((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))))))) : (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_1 == ((unsigned short int) 50)) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] EXPR ((WrapperStruct00.var_1_2 >= 64.5f) ? ((WrapperStruct00.var_1_2 >= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) < 0 ) ? -((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) : ((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))))))) : (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_1 == ((unsigned short int) 50))) && (WrapperStruct00.var_1_8 == ((signed short int) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] EXPR ((WrapperStruct00.var_1_2 >= 64.5f) ? ((WrapperStruct00.var_1_2 >= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) < 0 ) ? -((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) : ((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))))))) : (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_1 == ((unsigned short int) 50))) && (WrapperStruct00.var_1_8 == ((signed short int) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] EXPR (((WrapperStruct00.var_1_2 >= 64.5f) ? ((WrapperStruct00.var_1_2 >= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) < 0 ) ? -((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) : ((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))))))) : (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_1 == ((unsigned short int) 50))) && (WrapperStruct00.var_1_8 == ((signed short int) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9)))))) && (((50 >> WrapperStruct00.var_1_4) <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_10 == ((unsigned char) ((! (! WrapperStruct00.var_1_11)) || WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_10 == ((unsigned char) (! WrapperStruct00.var_1_11)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] EXPR (((WrapperStruct00.var_1_2 >= 64.5f) ? ((WrapperStruct00.var_1_2 >= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) < 0 ) ? -((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) : ((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))))))) : (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_1 == ((unsigned short int) 50))) && (WrapperStruct00.var_1_8 == ((signed short int) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9)))))) && (((50 >> WrapperStruct00.var_1_4) <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_10 == ((unsigned char) ((! (! WrapperStruct00.var_1_11)) || WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_10 == ((unsigned char) (! WrapperStruct00.var_1_11)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] EXPR ((((WrapperStruct00.var_1_2 >= 64.5f) ? ((WrapperStruct00.var_1_2 >= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) < 0 ) ? -((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) : ((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))))))) : (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_1 == ((unsigned short int) 50))) && (WrapperStruct00.var_1_8 == ((signed short int) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9)))))) && (((50 >> WrapperStruct00.var_1_4) <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_10 == ((unsigned char) ((! (! WrapperStruct00.var_1_11)) || WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_10 == ((unsigned char) (! WrapperStruct00.var_1_11))))) && ((! WrapperStruct00.var_1_12) ? ((WrapperStruct00.var_1_4 >= ((((WrapperStruct00.var_1_6) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_10 && WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_11))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] EXPR ((((WrapperStruct00.var_1_2 >= 64.5f) ? ((WrapperStruct00.var_1_2 >= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) < 0 ) ? -((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) : ((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))))))) : (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_1 == ((unsigned short int) 50))) && (WrapperStruct00.var_1_8 == ((signed short int) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9)))))) && (((50 >> WrapperStruct00.var_1_4) <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_10 == ((unsigned char) ((! (! WrapperStruct00.var_1_11)) || WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_10 == ((unsigned char) (! WrapperStruct00.var_1_11))))) && ((! WrapperStruct00.var_1_12) ? ((WrapperStruct00.var_1_4 >= ((((WrapperStruct00.var_1_6) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_10 && WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_11))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L108-L109] return ((((WrapperStruct00.var_1_2 >= 64.5f) ? ((WrapperStruct00.var_1_2 >= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) < 0 ) ? -((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) : ((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))))))) : (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_1 == ((unsigned short int) 50))) && (WrapperStruct00.var_1_8 == ((signed short int) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9)))))) && (((50 >> WrapperStruct00.var_1_4) <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_10 == ((unsigned char) ((! (! WrapperStruct00.var_1_11)) || WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_10 == ((unsigned char) (! WrapperStruct00.var_1_11))))) && ((! WrapperStruct00.var_1_12) ? ((WrapperStruct00.var_1_4 >= ((((WrapperStruct00.var_1_6) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_10 && WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_11))) : 1) ; [L118] RET, EXPR property() [L118] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 129 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.4s, OverallIterations: 6, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1568 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1533 mSDsluCounter, 2847 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2192 mSDsCounter, 190 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4921 IncrementalHoareTripleChecker+Invalid, 5111 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 190 mSolverCounterUnsat, 655 mSDtfsCounter, 4921 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 485 GetRequests, 400 SyntacticMatches, 7 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=317occurred in iteration=5, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 556 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 802 NumberOfCodeBlocks, 802 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 795 ConstructedInterpolants, 0 QuantifiedInterpolants, 2950 SizeOfPredicates, 6 NumberOfNonLiveVariables, 378 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 2530/2548 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:49:09,954 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-s_file-49.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 06bb6f3bbb0c6ee3bc73b3f1732ad2bc217c179634d5fa3dbf744e010ef897a1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:49:12,181 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:49:12,249 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:49:12,257 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:49:12,257 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:49:12,286 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:49:12,286 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:49:12,287 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:49:12,287 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:49:12,288 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:49:12,288 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:49:12,288 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:49:12,289 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:49:12,289 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:49:12,290 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:49:12,290 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:49:12,291 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:49:12,291 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:49:12,291 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:49:12,292 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:49:12,292 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:49:12,293 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:49:12,293 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:49:12,293 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:49:12,294 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:49:12,294 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:49:12,294 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:49:12,301 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:49:12,302 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:49:12,302 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:49:12,302 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:49:12,302 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:49:12,303 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:49:12,303 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:49:12,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:49:12,303 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:49:12,303 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:49:12,304 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:49:12,304 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:49:12,304 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:49:12,304 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:49:12,305 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:49:12,305 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:49:12,306 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:49:12,306 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:49:12,307 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 -> 06bb6f3bbb0c6ee3bc73b3f1732ad2bc217c179634d5fa3dbf744e010ef897a1 [2024-10-24 11:49:12,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:49:12,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:49:12,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:49:12,665 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:49:12,665 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:49:12,668 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-49.i [2024-10-24 11:49:14,235 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:49:14,450 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:49:14,452 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-49.i [2024-10-24 11:49:14,464 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67e476ab0/7867ec26876c4fe79a910995cd048469/FLAG6d20d9063 [2024-10-24 11:49:14,482 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67e476ab0/7867ec26876c4fe79a910995cd048469 [2024-10-24 11:49:14,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:49:14,486 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:49:14,488 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:49:14,488 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:49:14,493 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:49:14,494 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:49:14" (1/1) ... [2024-10-24 11:49:14,496 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@171f98c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:49:14, skipping insertion in model container [2024-10-24 11:49:14,497 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:49:14" (1/1) ... [2024-10-24 11:49:14,526 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:49:14,711 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-s_file-49.i[916,929] [2024-10-24 11:49:14,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:49:14,816 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:49:14,829 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-s_file-49.i[916,929] [2024-10-24 11:49:14,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:49:14,915 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:49:14,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:49:14 WrapperNode [2024-10-24 11:49:14,916 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:49:14,917 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:49:14,917 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:49:14,917 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:49:14,924 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:49:14" (1/1) ... [2024-10-24 11:49:14,953 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:49:14" (1/1) ... [2024-10-24 11:49:15,014 INFO L138 Inliner]: procedures = 33, calls = 192, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 641 [2024-10-24 11:49:15,015 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:49:15,016 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:49:15,016 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:49:15,016 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:49:15,027 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:49:14" (1/1) ... [2024-10-24 11:49:15,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:49:14" (1/1) ... [2024-10-24 11:49:15,038 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:49:14" (1/1) ... [2024-10-24 11:49:15,073 INFO L175 MemorySlicer]: Split 166 memory accesses to 2 slices as follows [2, 164]. 99 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 17 writes are split as follows [0, 17]. [2024-10-24 11:49:15,073 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:49:14" (1/1) ... [2024-10-24 11:49:15,076 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:49:14" (1/1) ... [2024-10-24 11:49:15,107 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:49:14" (1/1) ... [2024-10-24 11:49:15,116 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:49:14" (1/1) ... [2024-10-24 11:49:15,123 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:49:14" (1/1) ... [2024-10-24 11:49:15,130 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:49:14" (1/1) ... [2024-10-24 11:49:15,142 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:49:15,143 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:49:15,144 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:49:15,144 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:49:15,145 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:49:14" (1/1) ... [2024-10-24 11:49:15,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:49:15,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:49:15,182 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:49:15,200 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:49:15,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:49:15,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 11:49:15,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 11:49:15,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-24 11:49:15,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-24 11:49:15,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:49:15,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 11:49:15,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-24 11:49:15,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-24 11:49:15,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-24 11:49:15,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-24 11:49:15,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-24 11:49:15,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-24 11:49:15,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-24 11:49:15,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-24 11:49:15,253 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:49:15,253 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:49:15,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:49:15,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:49:15,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 11:49:15,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 11:49:15,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-24 11:49:15,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-24 11:49:15,382 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:49:15,384 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:49:16,111 INFO L? ?]: Removed 212 outVars from TransFormulas that were not future-live. [2024-10-24 11:49:16,112 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:49:16,156 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:49:16,158 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:49:16,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:49:16 BoogieIcfgContainer [2024-10-24 11:49:16,158 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:49:16,161 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:49:16,161 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:49:16,164 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:49:16,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:49:14" (1/3) ... [2024-10-24 11:49:16,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4413429a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:49:16, skipping insertion in model container [2024-10-24 11:49:16,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:49:14" (2/3) ... [2024-10-24 11:49:16,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4413429a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:49:16, skipping insertion in model container [2024-10-24 11:49:16,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:49:16" (3/3) ... [2024-10-24 11:49:16,178 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-49.i [2024-10-24 11:49:16,198 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:49:16,198 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:49:16,268 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:49:16,275 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;@22a5f233, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:49:16,275 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:49:16,280 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 106 states have (on average 1.509433962264151) internal successors, (160), 107 states have internal predecessors, (160), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:49:16,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-24 11:49:16,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:49:16,297 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:16,297 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:49:16,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:49:16,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1137980605, now seen corresponding path program 1 times [2024-10-24 11:49:16,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:49:16,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [17297074] [2024-10-24 11:49:16,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:16,320 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:49:16,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:49:16,323 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:49:16,325 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:49:16,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:16,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:49:16,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:49:16,675 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-10-24 11:49:16,675 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:49:16,676 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:49:16,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [17297074] [2024-10-24 11:49:16,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [17297074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:49:16,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:49:16,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:49:16,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90043224] [2024-10-24 11:49:16,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:49:16,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:49:16,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:49:16,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:49:16,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:49:16,718 INFO L87 Difference]: Start difference. First operand has 123 states, 106 states have (on average 1.509433962264151) internal successors, (160), 107 states have internal predecessors, (160), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:49:16,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:49:16,761 INFO L93 Difference]: Finished difference Result 243 states and 388 transitions. [2024-10-24 11:49:16,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:49:16,766 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), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 110 [2024-10-24 11:49:16,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:49:16,776 INFO L225 Difference]: With dead ends: 243 [2024-10-24 11:49:16,776 INFO L226 Difference]: Without dead ends: 121 [2024-10-24 11:49:16,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 109 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:49:16,784 INFO L432 NwaCegarLoop]: 179 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, 179 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:49:16,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 179 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:49:16,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-24 11:49:16,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-10-24 11:49:16,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 105 states have (on average 1.4761904761904763) internal successors, (155), 105 states have internal predecessors, (155), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:49:16,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 183 transitions. [2024-10-24 11:49:16,842 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 183 transitions. Word has length 110 [2024-10-24 11:49:16,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:49:16,844 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 183 transitions. [2024-10-24 11:49:16,844 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), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:49:16,845 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 183 transitions. [2024-10-24 11:49:16,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-24 11:49:16,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:49:16,849 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:16,857 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:49:17,053 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:49:17,054 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:49:17,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:49:17,055 INFO L85 PathProgramCache]: Analyzing trace with hash -152657173, now seen corresponding path program 1 times [2024-10-24 11:49:17,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:49:17,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1289872418] [2024-10-24 11:49:17,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:17,056 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:49:17,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:49:17,058 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:49:17,080 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:49:17,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:17,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 11:49:17,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:49:17,408 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:49:17,506 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:49:17,530 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:49:17,531 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:49:17,531 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:49:17,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1289872418] [2024-10-24 11:49:17,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1289872418] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:49:17,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:49:17,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:49:17,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077353849] [2024-10-24 11:49:17,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:49:17,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:49:17,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:49:17,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:49:17,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:49:17,538 INFO L87 Difference]: Start difference. First operand 121 states and 183 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:49:18,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:49:18,326 INFO L93 Difference]: Finished difference Result 363 states and 550 transitions. [2024-10-24 11:49:18,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:49:18,328 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 110 [2024-10-24 11:49:18,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:49:18,330 INFO L225 Difference]: With dead ends: 363 [2024-10-24 11:49:18,331 INFO L226 Difference]: Without dead ends: 243 [2024-10-24 11:49:18,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:49:18,333 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 166 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 11:49:18,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 632 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 11:49:18,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-10-24 11:49:18,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 125. [2024-10-24 11:49:18,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 109 states have (on average 1.4678899082568808) internal successors, (160), 109 states have internal predecessors, (160), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:49:18,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 188 transitions. [2024-10-24 11:49:18,350 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 188 transitions. Word has length 110 [2024-10-24 11:49:18,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:49:18,352 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 188 transitions. [2024-10-24 11:49:18,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:49:18,352 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 188 transitions. [2024-10-24 11:49:18,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-24 11:49:18,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:49:18,354 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:18,368 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:49:18,555 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:49:18,555 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:49:18,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:49:18,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1270061776, now seen corresponding path program 1 times [2024-10-24 11:49:18,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:49:18,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2045051907] [2024-10-24 11:49:18,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:18,557 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:49:18,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:49:18,561 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:49:18,562 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:49:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:18,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 11:49:18,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:49:18,862 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 8 treesize of output 1 [2024-10-24 11:49:18,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2024-10-24 11:49:18,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2024-10-24 11:49:18,948 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 22 treesize of output 10 [2024-10-24 11:49:18,993 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-24 11:49:18,994 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:49:18,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:49:18,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2045051907] [2024-10-24 11:49:18,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2045051907] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:49:18,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:49:18,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:49:18,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089785085] [2024-10-24 11:49:18,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:49:18,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:49:18,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:49:18,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:49:18,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:49:18,999 INFO L87 Difference]: Start difference. First operand 125 states and 188 transitions. Second operand has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:49:19,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:49:19,951 INFO L93 Difference]: Finished difference Result 257 states and 382 transitions. [2024-10-24 11:49:19,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 11:49:19,952 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 112 [2024-10-24 11:49:19,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:49:19,954 INFO L225 Difference]: With dead ends: 257 [2024-10-24 11:49:19,954 INFO L226 Difference]: Without dead ends: 133 [2024-10-24 11:49:19,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:49:19,957 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 147 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 11:49:19,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 262 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 11:49:19,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-24 11:49:19,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2024-10-24 11:49:19,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 112 states have (on average 1.4464285714285714) internal successors, (162), 112 states have internal predecessors, (162), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:49:19,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 190 transitions. [2024-10-24 11:49:19,968 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 190 transitions. Word has length 112 [2024-10-24 11:49:19,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:49:19,969 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 190 transitions. [2024-10-24 11:49:19,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:49:19,970 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 190 transitions. [2024-10-24 11:49:19,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 11:49:19,972 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:49:19,972 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:19,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 11:49:20,173 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:49:20,174 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:49:20,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:49:20,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1856750218, now seen corresponding path program 1 times [2024-10-24 11:49:20,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:49:20,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1014680219] [2024-10-24 11:49:20,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:20,175 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:49:20,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:49:20,179 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:49:20,180 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:49:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:20,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-24 11:49:20,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:49:20,482 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 14 treesize of output 10 [2024-10-24 11:49:20,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 25 treesize of output 24 [2024-10-24 11:49:20,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:20,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2024-10-24 11:49:20,927 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 56 treesize of output 46 [2024-10-24 11:49:20,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:20,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 58 [2024-10-24 11:49:21,295 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:21,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 59 [2024-10-24 11:49:21,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:21,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 67 [2024-10-24 11:49:21,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:21,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 32 [2024-10-24 11:49:21,972 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-10-24 11:49:21,973 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:49:21,973 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:49:21,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1014680219] [2024-10-24 11:49:21,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1014680219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:49:21,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:49:21,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-24 11:49:21,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845426953] [2024-10-24 11:49:21,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:49:21,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 11:49:21,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:49:21,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 11:49:21,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-10-24 11:49:21,976 INFO L87 Difference]: Start difference. First operand 129 states and 190 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-24 11:49:27,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:49:27,522 INFO L93 Difference]: Finished difference Result 548 states and 812 transitions. [2024-10-24 11:49:27,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 11:49:27,523 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 114 [2024-10-24 11:49:27,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:49:27,526 INFO L225 Difference]: With dead ends: 548 [2024-10-24 11:49:27,526 INFO L226 Difference]: Without dead ends: 420 [2024-10-24 11:49:27,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2024-10-24 11:49:27,528 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 845 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 1784 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 1860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:49:27,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 864 Invalid, 1860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1784 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-10-24 11:49:27,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-10-24 11:49:27,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 270. [2024-10-24 11:49:27,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 244 states have (on average 1.4754098360655739) internal successors, (360), 245 states have internal predecessors, (360), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 11:49:27,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 404 transitions. [2024-10-24 11:49:27,569 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 404 transitions. Word has length 114 [2024-10-24 11:49:27,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:49:27,570 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 404 transitions. [2024-10-24 11:49:27,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-24 11:49:27,571 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 404 transitions. [2024-10-24 11:49:27,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 11:49:27,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:49:27,572 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:27,583 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:49:27,773 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:49:27,773 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:49:27,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:49:27,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1176691848, now seen corresponding path program 1 times [2024-10-24 11:49:27,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:49:27,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [129038205] [2024-10-24 11:49:27,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:27,775 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:49:27,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:49:27,778 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:49:27,780 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:49:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:28,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 11:49:28,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:49:28,062 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 8 treesize of output 1 [2024-10-24 11:49:28,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2024-10-24 11:49:28,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2024-10-24 11:49:28,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2024-10-24 11:49:28,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 24 treesize of output 23 [2024-10-24 11:49:28,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:28,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2024-10-24 11:49:28,180 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:49:28,180 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:49:28,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:49:28,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [129038205] [2024-10-24 11:49:28,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [129038205] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:49:28,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:49:28,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:49:28,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197996543] [2024-10-24 11:49:28,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:49:28,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:49:28,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:49:28,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:49:28,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:49:28,183 INFO L87 Difference]: Start difference. First operand 270 states and 404 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:49:29,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:49:29,120 INFO L93 Difference]: Finished difference Result 795 states and 1188 transitions. [2024-10-24 11:49:29,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:49:29,121 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2024-10-24 11:49:29,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:49:29,125 INFO L225 Difference]: With dead ends: 795 [2024-10-24 11:49:29,125 INFO L226 Difference]: Without dead ends: 526 [2024-10-24 11:49:29,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:49:29,127 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 288 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 11:49:29,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 452 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 11:49:29,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-10-24 11:49:29,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 275. [2024-10-24 11:49:29,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 249 states have (on average 1.465863453815261) internal successors, (365), 250 states have internal predecessors, (365), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 11:49:29,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 409 transitions. [2024-10-24 11:49:29,153 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 409 transitions. Word has length 114 [2024-10-24 11:49:29,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:49:29,154 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 409 transitions. [2024-10-24 11:49:29,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:49:29,154 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 409 transitions. [2024-10-24 11:49:29,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 11:49:29,156 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:49:29,156 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:29,166 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 (6)] Forceful destruction successful, exit code 0 [2024-10-24 11:49:29,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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:49:29,357 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:49:29,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:49:29,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1074978627, now seen corresponding path program 1 times [2024-10-24 11:49:29,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:49:29,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1399800515] [2024-10-24 11:49:29,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:29,359 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:49:29,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:49:29,361 INFO L229 MonitoredProcess]: Starting monitored process 7 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:49:29,362 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 (7)] Waiting until timeout for monitored process [2024-10-24 11:49:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:29,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-24 11:49:29,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:49:29,627 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 8 treesize of output 1 [2024-10-24 11:49:29,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 26 treesize of output 25 [2024-10-24 11:49:29,813 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:29,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2024-10-24 11:49:29,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:29,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2024-10-24 11:49:29,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:29,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 39 [2024-10-24 11:49:29,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:29,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 19 [2024-10-24 11:49:29,957 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 123 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-10-24 11:49:29,957 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:49:30,212 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 33 proven. 6 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-24 11:49:30,213 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:49:30,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1399800515] [2024-10-24 11:49:30,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1399800515] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:49:30,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:49:30,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2024-10-24 11:49:30,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110643716] [2024-10-24 11:49:30,213 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:49:30,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 11:49:30,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:49:30,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 11:49:30,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:49:30,215 INFO L87 Difference]: Start difference. First operand 275 states and 409 transitions. Second operand has 14 states, 12 states have (on average 5.916666666666667) internal successors, (71), 14 states have internal predecessors, (71), 5 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) [2024-10-24 11:49:32,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:49:32,120 INFO L93 Difference]: Finished difference Result 847 states and 1247 transitions. [2024-10-24 11:49:32,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-24 11:49:32,121 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.916666666666667) internal successors, (71), 14 states have internal predecessors, (71), 5 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) Word has length 114 [2024-10-24 11:49:32,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:49:32,124 INFO L225 Difference]: With dead ends: 847 [2024-10-24 11:49:32,124 INFO L226 Difference]: Without dead ends: 573 [2024-10-24 11:49:32,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 214 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=239, Invalid=753, Unknown=0, NotChecked=0, Total=992 [2024-10-24 11:49:32,128 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 726 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 1239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:49:32,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 410 Invalid, 1239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 11:49:32,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2024-10-24 11:49:32,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 289. [2024-10-24 11:49:32,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 262 states have (on average 1.4618320610687023) internal successors, (383), 263 states have internal predecessors, (383), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 11:49:32,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 427 transitions. [2024-10-24 11:49:32,167 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 427 transitions. Word has length 114 [2024-10-24 11:49:32,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:49:32,167 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 427 transitions. [2024-10-24 11:49:32,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.916666666666667) internal successors, (71), 14 states have internal predecessors, (71), 5 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) [2024-10-24 11:49:32,168 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 427 transitions. [2024-10-24 11:49:32,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 11:49:32,169 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:49:32,169 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:32,181 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 (7)] Forceful destruction successful, exit code 0 [2024-10-24 11:49:32,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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:49:32,370 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:49:32,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:49:32,371 INFO L85 PathProgramCache]: Analyzing trace with hash -816813189, now seen corresponding path program 1 times [2024-10-24 11:49:32,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:49:32,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [892843082] [2024-10-24 11:49:32,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:32,372 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:49:32,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:49:32,373 INFO L229 MonitoredProcess]: Starting monitored process 8 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:49:32,375 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 (8)] Waiting until timeout for monitored process [2024-10-24 11:49:32,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:32,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-24 11:49:32,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:49:32,688 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 19 treesize of output 1 [2024-10-24 11:49:32,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 80 treesize of output 34 [2024-10-24 11:49:33,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 80 treesize of output 34 [2024-10-24 11:49:33,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 80 treesize of output 34 [2024-10-24 11:49:33,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 80 treesize of output 34 [2024-10-24 11:49:33,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 75 treesize of output 44 [2024-10-24 11:49:33,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:33,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 47 [2024-10-24 11:49:33,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:33,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 47 [2024-10-24 11:49:33,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:33,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 47 [2024-10-24 11:49:33,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:33,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 47 [2024-10-24 11:49:33,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:33,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 154 treesize of output 58 [2024-10-24 11:49:33,948 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-10-24 11:49:33,948 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:49:33,949 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:49:33,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [892843082] [2024-10-24 11:49:33,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [892843082] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:49:33,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:49:33,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:49:33,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426417848] [2024-10-24 11:49:33,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:49:33,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:49:33,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:49:33,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:49:33,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:49:33,950 INFO L87 Difference]: Start difference. First operand 289 states and 427 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-24 11:49:35,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:49:35,729 INFO L93 Difference]: Finished difference Result 863 states and 1269 transitions. [2024-10-24 11:49:35,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 11:49:35,730 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 114 [2024-10-24 11:49:35,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:49:35,733 INFO L225 Difference]: With dead ends: 863 [2024-10-24 11:49:35,733 INFO L226 Difference]: Without dead ends: 575 [2024-10-24 11:49:35,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:49:35,735 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 286 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:49:35,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 471 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 11:49:35,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2024-10-24 11:49:35,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 563. [2024-10-24 11:49:35,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 508 states have (on average 1.4507874015748032) internal successors, (737), 512 states have internal predecessors, (737), 44 states have call successors, (44), 10 states have call predecessors, (44), 10 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-24 11:49:35,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 825 transitions. [2024-10-24 11:49:35,788 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 825 transitions. Word has length 114 [2024-10-24 11:49:35,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:49:35,789 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 825 transitions. [2024-10-24 11:49:35,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-24 11:49:35,789 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 825 transitions. [2024-10-24 11:49:35,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 11:49:35,791 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:49:35,791 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:35,802 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 (8)] Ended with exit code 0 [2024-10-24 11:49:35,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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:49:35,992 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:49:35,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:49:35,993 INFO L85 PathProgramCache]: Analyzing trace with hash 849869176, now seen corresponding path program 1 times [2024-10-24 11:49:35,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:49:35,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1056822735] [2024-10-24 11:49:35,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:35,994 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:49:35,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:49:35,996 INFO L229 MonitoredProcess]: Starting monitored process 9 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:49:35,997 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 (9)] Waiting until timeout for monitored process [2024-10-24 11:49:36,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:36,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-24 11:49:36,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:49:36,278 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 14 treesize of output 10 [2024-10-24 11:49:36,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 14 [2024-10-24 11:49:36,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 14 [2024-10-24 11:49:36,427 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 46 treesize of output 33 [2024-10-24 11:49:36,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:36,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 45 [2024-10-24 11:49:36,570 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:36,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 57 [2024-10-24 11:49:36,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:36,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 47 [2024-10-24 11:49:36,898 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:36,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 28 [2024-10-24 11:49:37,029 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-10-24 11:49:37,030 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:49:37,030 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:49:37,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1056822735] [2024-10-24 11:49:37,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1056822735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:49:37,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:49:37,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-24 11:49:37,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892710186] [2024-10-24 11:49:37,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:49:37,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 11:49:37,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:49:37,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 11:49:37,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:49:37,032 INFO L87 Difference]: Start difference. First operand 563 states and 825 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:49:43,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:49:43,885 INFO L93 Difference]: Finished difference Result 1683 states and 2467 transitions. [2024-10-24 11:49:43,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 11:49:43,887 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2024-10-24 11:49:43,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:49:43,893 INFO L225 Difference]: With dead ends: 1683 [2024-10-24 11:49:43,894 INFO L226 Difference]: Without dead ends: 1121 [2024-10-24 11:49:43,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2024-10-24 11:49:43,896 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 690 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 2482 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 1356 SdHoareTripleChecker+Invalid, 2536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:49:43,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 1356 Invalid, 2536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2482 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2024-10-24 11:49:43,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2024-10-24 11:49:43,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 565. [2024-10-24 11:49:43,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 510 states have (on average 1.4529411764705882) internal successors, (741), 514 states have internal predecessors, (741), 44 states have call successors, (44), 10 states have call predecessors, (44), 10 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-24 11:49:43,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 829 transitions. [2024-10-24 11:49:43,960 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 829 transitions. Word has length 114 [2024-10-24 11:49:43,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:49:43,961 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 829 transitions. [2024-10-24 11:49:43,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:49:43,961 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 829 transitions. [2024-10-24 11:49:43,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 11:49:43,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:49:43,963 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:43,974 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 (9)] Forceful destruction successful, exit code 0 [2024-10-24 11:49:44,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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:49:44,164 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:49:44,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:49:44,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1637895500, now seen corresponding path program 1 times [2024-10-24 11:49:44,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:49:44,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1942572724] [2024-10-24 11:49:44,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:44,166 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:49:44,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:49:44,169 INFO L229 MonitoredProcess]: Starting monitored process 10 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:49:44,170 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 (10)] Waiting until timeout for monitored process [2024-10-24 11:49:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:44,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 11:49:44,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:49:44,446 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 8 treesize of output 1 [2024-10-24 11:49:44,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 32 treesize of output 16 [2024-10-24 11:49:44,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 32 treesize of output 16 [2024-10-24 11:49:44,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 32 treesize of output 16 [2024-10-24 11:49:44,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 25 treesize of output 24 [2024-10-24 11:49:44,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:44,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 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:49:44,526 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:49:44,526 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:49:44,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:49:44,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1942572724] [2024-10-24 11:49:44,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1942572724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:49:44,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:49:44,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:49:44,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985418392] [2024-10-24 11:49:44,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:49:44,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:49:44,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:49:44,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:49:44,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:49:44,528 INFO L87 Difference]: Start difference. First operand 565 states and 829 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:49:46,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:49:48,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:49:50,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:49:51,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:49:53,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:49:55,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:49:57,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:49:59,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:50:01,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:50:03,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:50:05,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:50:07,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:50:10,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:50:11,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:50:13,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:50:16,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:50:16,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:50:16,263 INFO L93 Difference]: Finished difference Result 1289 states and 1882 transitions. [2024-10-24 11:50:16,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:50:16,264 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2024-10-24 11:50:16,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:50:16,268 INFO L225 Difference]: With dead ends: 1289 [2024-10-24 11:50:16,268 INFO L226 Difference]: Without dead ends: 725 [2024-10-24 11:50:16,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:50:16,271 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 331 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 37 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:50:16,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 668 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 627 Invalid, 14 Unknown, 0 Unchecked, 31.6s Time] [2024-10-24 11:50:16,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2024-10-24 11:50:16,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 475. [2024-10-24 11:50:16,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 437 states have (on average 1.459954233409611) internal successors, (638), 438 states have internal predecessors, (638), 28 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 11:50:16,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 694 transitions. [2024-10-24 11:50:16,314 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 694 transitions. Word has length 114 [2024-10-24 11:50:16,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:50:16,315 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 694 transitions. [2024-10-24 11:50:16,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:50:16,315 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 694 transitions. [2024-10-24 11:50:16,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 11:50:16,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:50:16,317 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:16,329 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 (10)] Forceful destruction successful, exit code 0 [2024-10-24 11:50:16,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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:50:16,518 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:50:16,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:50:16,522 INFO L85 PathProgramCache]: Analyzing trace with hash -957837130, now seen corresponding path program 1 times [2024-10-24 11:50:16,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:50:16,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1735136632] [2024-10-24 11:50:16,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:50:16,523 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:50:16,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:50:16,526 INFO L229 MonitoredProcess]: Starting monitored process 11 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:50:16,531 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 (11)] Waiting until timeout for monitored process [2024-10-24 11:50:16,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:50:16,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-24 11:50:16,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:50:16,822 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 19 treesize of output 1 [2024-10-24 11:50:16,824 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 14 treesize of output 10 [2024-10-24 11:50:16,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 25 treesize of output 24 [2024-10-24 11:50:16,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2024-10-24 11:50:17,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:50:17,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 67 [2024-10-24 11:50:17,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:50:17,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 71 [2024-10-24 11:50:17,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:50:17,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 79