./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-47.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-47.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 2b982617b4eafec7cbb1a277d4cd75e5591003436ed1218fbd6f7cc65704fea2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:07:26,995 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:07:27,086 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 01:07:27,092 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:07:27,092 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:07:27,126 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:07:27,126 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:07:27,127 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:07:27,128 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:07:27,129 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:07:27,130 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:07:27,130 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:07:27,131 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:07:27,132 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:07:27,132 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:07:27,132 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:07:27,133 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:07:27,133 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:07:27,133 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 01:07:27,133 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:07:27,134 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:07:27,134 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:07:27,134 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:07:27,135 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:07:27,135 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:07:27,135 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:07:27,135 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:07:27,136 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:07:27,136 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:07:27,136 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:07:27,136 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:07:27,137 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:07:27,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:07:27,137 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:07:27,137 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:07:27,137 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:07:27,138 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 01:07:27,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 01:07:27,138 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:07:27,139 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:07:27,140 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:07:27,140 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:07:27,140 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 -> 2b982617b4eafec7cbb1a277d4cd75e5591003436ed1218fbd6f7cc65704fea2 [2024-11-19 01:07:27,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:07:27,417 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:07:27,420 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:07:27,421 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:07:27,422 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:07:27,423 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-47.i [2024-11-19 01:07:28,901 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:07:29,089 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:07:29,090 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-47.i [2024-11-19 01:07:29,098 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ec58f144/1a6cc0022a5a4f9aa147c3321da994ed/FLAG4d7d4c75d [2024-11-19 01:07:29,112 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ec58f144/1a6cc0022a5a4f9aa147c3321da994ed [2024-11-19 01:07:29,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:07:29,117 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:07:29,118 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:07:29,118 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:07:29,123 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:07:29,124 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:07:29" (1/1) ... [2024-11-19 01:07:29,125 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d3a8c2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:29, skipping insertion in model container [2024-11-19 01:07:29,125 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:07:29" (1/1) ... [2024-11-19 01:07:29,150 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:07:29,301 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-47.i[916,929] [2024-11-19 01:07:29,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:07:29,360 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:07:29,369 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-47.i[916,929] [2024-11-19 01:07:29,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:07:29,438 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:07:29,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:29 WrapperNode [2024-11-19 01:07:29,439 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:07:29,440 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:07:29,441 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:07:29,441 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:07:29,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:29" (1/1) ... [2024-11-19 01:07:29,463 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:29" (1/1) ... [2024-11-19 01:07:29,506 INFO L138 Inliner]: procedures = 29, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 451 [2024-11-19 01:07:29,507 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:07:29,507 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:07:29,510 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:07:29,510 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:07:29,521 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:29" (1/1) ... [2024-11-19 01:07:29,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:29" (1/1) ... [2024-11-19 01:07:29,527 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:29" (1/1) ... [2024-11-19 01:07:29,544 INFO L175 MemorySlicer]: Split 115 memory accesses to 2 slices as follows [2, 113]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 12 writes are split as follows [0, 12]. [2024-11-19 01:07:29,544 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:29" (1/1) ... [2024-11-19 01:07:29,545 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:29" (1/1) ... [2024-11-19 01:07:29,566 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:29" (1/1) ... [2024-11-19 01:07:29,571 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:29" (1/1) ... [2024-11-19 01:07:29,573 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:29" (1/1) ... [2024-11-19 01:07:29,575 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:29" (1/1) ... [2024-11-19 01:07:29,579 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:07:29,580 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:07:29,581 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:07:29,581 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:07:29,582 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:29" (1/1) ... [2024-11-19 01:07:29,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:07:29,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:07:29,625 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 01:07:29,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 01:07:29,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:07:29,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-19 01:07:29,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-19 01:07:29,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 01:07:29,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 01:07:29,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-19 01:07:29,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-19 01:07:29,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 01:07:29,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 01:07:29,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-19 01:07:29,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-19 01:07:29,693 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:07:29,693 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:07:29,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 01:07:29,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 01:07:29,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:07:29,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:07:29,809 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:07:29,811 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:07:30,295 INFO L? ?]: Removed 130 outVars from TransFormulas that were not future-live. [2024-11-19 01:07:30,296 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:07:30,316 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:07:30,318 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:07:30,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:07:30 BoogieIcfgContainer [2024-11-19 01:07:30,319 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:07:30,323 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:07:30,323 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:07:30,326 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:07:30,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:07:29" (1/3) ... [2024-11-19 01:07:30,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a1636f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:07:30, skipping insertion in model container [2024-11-19 01:07:30,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:29" (2/3) ... [2024-11-19 01:07:30,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a1636f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:07:30, skipping insertion in model container [2024-11-19 01:07:30,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:07:30" (3/3) ... [2024-11-19 01:07:30,332 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-47.i [2024-11-19 01:07:30,348 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:07:30,348 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:07:30,398 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:07:30,405 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;@6f20893a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:07:30,405 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:07:30,410 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 01:07:30,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 01:07:30,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:07:30,422 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:07:30,423 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:07:30,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:07:30,428 INFO L85 PathProgramCache]: Analyzing trace with hash -766083450, now seen corresponding path program 1 times [2024-11-19 01:07:30,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:07:30,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470146551] [2024-11-19 01:07:30,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:30,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:07:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:30,750 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-19 01:07:30,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:07:30,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470146551] [2024-11-19 01:07:30,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470146551] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:07:30,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101503999] [2024-11-19 01:07:30,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:30,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:07:30,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:07:30,755 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:07:30,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 01:07:30,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:30,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:07:30,964 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:07:30,992 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-19 01:07:30,996 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:07:30,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101503999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:07:30,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:07:30,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 01:07:31,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623183167] [2024-11-19 01:07:31,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:07:31,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:07:31,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:07:31,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:07:31,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:07:31,042 INFO L87 Difference]: Start difference. First operand has 96 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-19 01:07:31,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:07:31,081 INFO L93 Difference]: Finished difference Result 185 states and 285 transitions. [2024-11-19 01:07:31,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:07:31,083 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2024-11-19 01:07:31,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:07:31,090 INFO L225 Difference]: With dead ends: 185 [2024-11-19 01:07:31,090 INFO L226 Difference]: Without dead ends: 92 [2024-11-19 01:07:31,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:07:31,096 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:07:31,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:07:31,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-19 01:07:31,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-19 01:07:31,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 81 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 01:07:31,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-11-19 01:07:31,137 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 84 [2024-11-19 01:07:31,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:07:31,137 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-11-19 01:07:31,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-19 01:07:31,138 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-11-19 01:07:31,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 01:07:31,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:07:31,141 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:07:31,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 01:07:31,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 01:07:31,346 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:07:31,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:07:31,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1428001612, now seen corresponding path program 1 times [2024-11-19 01:07:31,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:07:31,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960969418] [2024-11-19 01:07:31,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:31,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:07:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:31,532 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 01:07:31,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:07:31,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960969418] [2024-11-19 01:07:31,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960969418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:07:31,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:07:31,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:07:31,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951762581] [2024-11-19 01:07:31,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:07:31,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:07:31,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:07:31,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:07:31,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:07:31,536 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 01:07:31,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:07:31,563 INFO L93 Difference]: Finished difference Result 182 states and 267 transitions. [2024-11-19 01:07:31,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:07:31,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-19 01:07:31,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:07:31,567 INFO L225 Difference]: With dead ends: 182 [2024-11-19 01:07:31,567 INFO L226 Difference]: Without dead ends: 93 [2024-11-19 01:07:31,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:07:31,571 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:07:31,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 260 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:07:31,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-19 01:07:31,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-19 01:07:31,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.4268292682926829) internal successors, (117), 82 states have internal predecessors, (117), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 01:07:31,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2024-11-19 01:07:31,587 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 84 [2024-11-19 01:07:31,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:07:31,589 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2024-11-19 01:07:31,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 01:07:31,589 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2024-11-19 01:07:31,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 01:07:31,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:07:31,595 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:07:31,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 01:07:31,595 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:07:31,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:07:31,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1178021942, now seen corresponding path program 1 times [2024-11-19 01:07:31,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:07:31,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645965318] [2024-11-19 01:07:31,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:31,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:07:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:31,919 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-19 01:07:31,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:07:31,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645965318] [2024-11-19 01:07:31,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645965318] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:07:31,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866223230] [2024-11-19 01:07:31,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:31,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:07:31,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:07:31,924 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:07:31,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 01:07:32,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:32,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 01:07:32,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:07:32,145 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 01:07:32,145 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:07:32,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866223230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:07:32,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:07:32,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-19 01:07:32,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064102329] [2024-11-19 01:07:32,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:07:32,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:07:32,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:07:32,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:07:32,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:07:32,147 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 01:07:32,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:07:32,184 INFO L93 Difference]: Finished difference Result 186 states and 271 transitions. [2024-11-19 01:07:32,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:07:32,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-19 01:07:32,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:07:32,206 INFO L225 Difference]: With dead ends: 186 [2024-11-19 01:07:32,206 INFO L226 Difference]: Without dead ends: 96 [2024-11-19 01:07:32,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:07:32,208 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 1 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:07:32,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 384 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:07:32,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-19 01:07:32,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-11-19 01:07:32,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 84 states have internal predecessors, (119), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 01:07:32,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2024-11-19 01:07:32,229 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 84 [2024-11-19 01:07:32,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:07:32,230 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2024-11-19 01:07:32,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 01:07:32,230 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2024-11-19 01:07:32,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 01:07:32,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:07:32,231 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:07:32,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 01:07:32,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-19 01:07:32,433 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:07:32,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:07:32,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1179868984, now seen corresponding path program 1 times [2024-11-19 01:07:32,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:07:32,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069650084] [2024-11-19 01:07:32,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:32,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:07:32,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:32,611 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-19 01:07:32,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:07:32,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069650084] [2024-11-19 01:07:32,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069650084] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:07:32,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519720924] [2024-11-19 01:07:32,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:32,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:07:32,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:07:32,615 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:07:32,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 01:07:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:32,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 01:07:32,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:07:32,821 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 01:07:32,822 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:07:32,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519720924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:07:32,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:07:32,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-11-19 01:07:32,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622845772] [2024-11-19 01:07:32,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:07:32,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:07:32,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:07:32,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:07:32,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:07:32,825 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 01:07:32,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:07:32,866 INFO L93 Difference]: Finished difference Result 190 states and 275 transitions. [2024-11-19 01:07:32,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:07:32,872 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-19 01:07:32,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:07:32,873 INFO L225 Difference]: With dead ends: 190 [2024-11-19 01:07:32,873 INFO L226 Difference]: Without dead ends: 98 [2024-11-19 01:07:32,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:07:32,875 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:07:32,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 509 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:07:32,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-19 01:07:32,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-19 01:07:32,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 87 states have internal predecessors, (122), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 01:07:32,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2024-11-19 01:07:32,893 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 84 [2024-11-19 01:07:32,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:07:32,894 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2024-11-19 01:07:32,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 01:07:32,894 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2024-11-19 01:07:32,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 01:07:32,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:07:32,895 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:07:32,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 01:07:33,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:07:33,096 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:07:33,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:07:33,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1603693142, now seen corresponding path program 1 times [2024-11-19 01:07:33,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:07:33,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925195021] [2024-11-19 01:07:33,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:33,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:07:33,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:07:33,166 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 01:07:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:07:33,256 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 01:07:33,257 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 01:07:33,258 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 01:07:33,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 01:07:33,262 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-19 01:07:33,325 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 01:07:33,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:07:33 BoogieIcfgContainer [2024-11-19 01:07:33,330 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 01:07:33,331 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 01:07:33,331 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 01:07:33,331 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 01:07:33,331 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:07:30" (3/4) ... [2024-11-19 01:07:33,336 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 01:07:33,337 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 01:07:33,338 INFO L158 Benchmark]: Toolchain (without parser) took 4221.22ms. Allocated memory was 176.2MB in the beginning and 243.3MB in the end (delta: 67.1MB). Free memory was 118.1MB in the beginning and 118.1MB in the end (delta: 6.2kB). Peak memory consumption was 65.5MB. Max. memory is 16.1GB. [2024-11-19 01:07:33,339 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 176.2MB. Free memory is still 138.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:07:33,341 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.03ms. Allocated memory is still 176.2MB. Free memory was 118.1MB in the beginning and 101.9MB in the end (delta: 16.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 01:07:33,341 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.03ms. Allocated memory is still 176.2MB. Free memory was 101.9MB in the beginning and 98.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 01:07:33,344 INFO L158 Benchmark]: Boogie Preprocessor took 72.15ms. Allocated memory is still 176.2MB. Free memory was 98.2MB in the beginning and 94.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 01:07:33,344 INFO L158 Benchmark]: RCFGBuilder took 738.97ms. Allocated memory was 176.2MB in the beginning and 243.3MB in the end (delta: 67.1MB). Free memory was 94.0MB in the beginning and 205.3MB in the end (delta: -111.3MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. [2024-11-19 01:07:33,345 INFO L158 Benchmark]: TraceAbstraction took 3007.70ms. Allocated memory is still 243.3MB. Free memory was 204.3MB in the beginning and 118.1MB in the end (delta: 86.2MB). Peak memory consumption was 83.0MB. Max. memory is 16.1GB. [2024-11-19 01:07:33,345 INFO L158 Benchmark]: Witness Printer took 6.47ms. Allocated memory is still 243.3MB. Free memory is still 118.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:07:33,346 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.20ms. Allocated memory is still 176.2MB. Free memory is still 138.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 321.03ms. Allocated memory is still 176.2MB. Free memory was 118.1MB in the beginning and 101.9MB in the end (delta: 16.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.03ms. Allocated memory is still 176.2MB. Free memory was 101.9MB in the beginning and 98.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.15ms. Allocated memory is still 176.2MB. Free memory was 98.2MB in the beginning and 94.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 738.97ms. Allocated memory was 176.2MB in the beginning and 243.3MB in the end (delta: 67.1MB). Free memory was 94.0MB in the beginning and 205.3MB in the end (delta: -111.3MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3007.70ms. Allocated memory is still 243.3MB. Free memory was 204.3MB in the beginning and 118.1MB in the end (delta: 86.2MB). Peak memory consumption was 83.0MB. Max. memory is 16.1GB. * Witness Printer took 6.47ms. Allocated memory is still 243.3MB. Free memory is still 118.1MB. 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 someBinaryDOUBLEComparisonOperation at line 95. Possible FailurePath: [L33] unsigned char isInitial = 0; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L45] signed long int last_1_WrapperStruct0_var_1_12 = 8; VAL [WrapperStruct0={4:0}, isInitial=0, last_1_WrapperStruct0_var_1_12=8] [L99] isInitial = 1 [L100] FCALL initially() [L101] COND TRUE 1 [L102] CALL updateLastVariables() [L92] EXPR WrapperStruct0.var_1_12 [L92] last_1_WrapperStruct0_var_1_12 = WrapperStruct0.var_1_12 [L102] RET updateLastVariables() [L103] CALL updateVariables() [L76] WrapperStruct0.var_1_8 = __VERIFIER_nondet_double() [L77] EXPR WrapperStruct0.var_1_8 [L77] EXPR WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L77] EXPR WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F [L77] EXPR WrapperStruct0.var_1_8 [L77] EXPR WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L77] EXPR (WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L77] EXPR (WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L77] CALL assume_abort_if_not((WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L77] RET assume_abort_if_not((WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L78] WrapperStruct0.var_1_10 = __VERIFIER_nondet_char() [L79] EXPR WrapperStruct0.var_1_10 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L79] CALL assume_abort_if_not(WrapperStruct0.var_1_10 >= -63) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L79] RET assume_abort_if_not(WrapperStruct0.var_1_10 >= -63) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L80] EXPR WrapperStruct0.var_1_10 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L80] CALL assume_abort_if_not(WrapperStruct0.var_1_10 <= 63) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L80] RET assume_abort_if_not(WrapperStruct0.var_1_10 <= 63) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L81] WrapperStruct0.var_1_11 = __VERIFIER_nondet_char() [L82] EXPR WrapperStruct0.var_1_11 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L82] CALL assume_abort_if_not(WrapperStruct0.var_1_11 >= -63) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L82] RET assume_abort_if_not(WrapperStruct0.var_1_11 >= -63) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L83] EXPR WrapperStruct0.var_1_11 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L83] CALL assume_abort_if_not(WrapperStruct0.var_1_11 <= 63) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L83] RET assume_abort_if_not(WrapperStruct0.var_1_11 <= 63) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L84] WrapperStruct0.var_1_13 = __VERIFIER_nondet_uchar() [L85] EXPR WrapperStruct0.var_1_13 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L85] CALL assume_abort_if_not(WrapperStruct0.var_1_13 >= 0) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L85] RET assume_abort_if_not(WrapperStruct0.var_1_13 >= 0) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L86] EXPR WrapperStruct0.var_1_13 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L86] CALL assume_abort_if_not(WrapperStruct0.var_1_13 <= 1) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L86] RET assume_abort_if_not(WrapperStruct0.var_1_13 <= 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L87] WrapperStruct0.var_1_14 = __VERIFIER_nondet_uchar() [L88] EXPR WrapperStruct0.var_1_14 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L88] CALL assume_abort_if_not(WrapperStruct0.var_1_14 >= 0) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L88] RET assume_abort_if_not(WrapperStruct0.var_1_14 >= 0) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L89] EXPR WrapperStruct0.var_1_14 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L89] CALL assume_abort_if_not(WrapperStruct0.var_1_14 <= 1) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L89] RET assume_abort_if_not(WrapperStruct0.var_1_14 <= 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L103] RET updateVariables() [L104] CALL step() [L49] COND FALSE !(-4 > last_1_WrapperStruct0_var_1_12) [L54] EXPR WrapperStruct0.var_1_10 [L54] WrapperStruct0.var_1_9 = WrapperStruct0.var_1_10 [L56] EXPR WrapperStruct0.var_1_13 [L56] unsigned char stepLocal_0 = ! WrapperStruct0.var_1_13; [L57] stepLocal_0 || WrapperStruct0.var_1_14 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L57] stepLocal_0 || WrapperStruct0.var_1_14 [L57] EXPR WrapperStruct0.var_1_14 [L57] stepLocal_0 || WrapperStruct0.var_1_14 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L57] COND FALSE !(stepLocal_0 || WrapperStruct0.var_1_14) [L64] EXPR WrapperStruct0.var_1_8 [L64] WrapperStruct0.var_1_15 = WrapperStruct0.var_1_8 [L65] EXPR WrapperStruct0.var_1_15 [L65] EXPR WrapperStruct0.var_1_15 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L65] COND FALSE !(WrapperStruct0.var_1_15 <= WrapperStruct0.var_1_15) [L70] EXPR WrapperStruct0.var_1_12 [L70] EXPR WrapperStruct0.var_1_9 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L70] COND TRUE WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9 [L71] EXPR WrapperStruct0.var_1_8 [L71] WrapperStruct0.var_1_1 = WrapperStruct0.var_1_8 [L104] RET step() [L105] CALL, EXPR property() [L95] EXPR WrapperStruct0.var_1_15 [L95] EXPR WrapperStruct0.var_1_15 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] EXPR (WrapperStruct0.var_1_15 <= WrapperStruct0.var_1_15) ? (((WrapperStruct0.var_1_12 + WrapperStruct0.var_1_12) >= (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_1 == ((double) ((((WrapperStruct0.var_1_8) < 0 ) ? -(WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_8))))) : 1) : ((WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1) [L95] EXPR WrapperStruct0.var_1_12 [L95] EXPR WrapperStruct0.var_1_9 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] EXPR (WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1 [L95] EXPR WrapperStruct0.var_1_1 [L95] EXPR WrapperStruct0.var_1_8 [L95] EXPR (WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] EXPR (WrapperStruct0.var_1_15 <= WrapperStruct0.var_1_15) ? (((WrapperStruct0.var_1_12 + WrapperStruct0.var_1_12) >= (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_1 == ((double) ((((WrapperStruct0.var_1_8) < 0 ) ? -(WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_8))))) : 1) : ((WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] EXPR ((WrapperStruct0.var_1_15 <= WrapperStruct0.var_1_15) ? (((WrapperStruct0.var_1_12 + WrapperStruct0.var_1_12) >= (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_1 == ((double) ((((WrapperStruct0.var_1_8) < 0 ) ? -(WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_8))))) : 1) : ((WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? (WrapperStruct0.var_1_9 == ((signed char) ((((WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) < 0 ) ? -(WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) : (WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11))))) : 1) : (WrapperStruct0.var_1_9 == ((signed char) WrapperStruct0.var_1_10))) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] EXPR ((WrapperStruct0.var_1_15 <= WrapperStruct0.var_1_15) ? (((WrapperStruct0.var_1_12 + WrapperStruct0.var_1_12) >= (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_1 == ((double) ((((WrapperStruct0.var_1_8) < 0 ) ? -(WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_8))))) : 1) : ((WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? (WrapperStruct0.var_1_9 == ((signed char) ((((WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) < 0 ) ? -(WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) : (WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11))))) : 1) : (WrapperStruct0.var_1_9 == ((signed char) WrapperStruct0.var_1_10))) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] EXPR (((WrapperStruct0.var_1_15 <= WrapperStruct0.var_1_15) ? (((WrapperStruct0.var_1_12 + WrapperStruct0.var_1_12) >= (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_1 == ((double) ((((WrapperStruct0.var_1_8) < 0 ) ? -(WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_8))))) : 1) : ((WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? (WrapperStruct0.var_1_9 == ((signed char) ((((WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) < 0 ) ? -(WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) : (WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11))))) : 1) : (WrapperStruct0.var_1_9 == ((signed char) WrapperStruct0.var_1_10)))) && (((! WrapperStruct0.var_1_13) || WrapperStruct0.var_1_14) ? ((! WrapperStruct0.var_1_14) ? (WrapperStruct0.var_1_12 == ((signed long int) (((((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))) < 0 ) ? -((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))) : ((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))))))) : (WrapperStruct0.var_1_12 == ((signed long int) WrapperStruct0.var_1_9))) : 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] EXPR (((WrapperStruct0.var_1_15 <= WrapperStruct0.var_1_15) ? (((WrapperStruct0.var_1_12 + WrapperStruct0.var_1_12) >= (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_1 == ((double) ((((WrapperStruct0.var_1_8) < 0 ) ? -(WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_8))))) : 1) : ((WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? (WrapperStruct0.var_1_9 == ((signed char) ((((WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) < 0 ) ? -(WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) : (WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11))))) : 1) : (WrapperStruct0.var_1_9 == ((signed char) WrapperStruct0.var_1_10)))) && (((! WrapperStruct0.var_1_13) || WrapperStruct0.var_1_14) ? ((! WrapperStruct0.var_1_14) ? (WrapperStruct0.var_1_12 == ((signed long int) (((((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))) < 0 ) ? -((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))) : ((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))))))) : (WrapperStruct0.var_1_12 == ((signed long int) WrapperStruct0.var_1_9))) : 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] EXPR ((((WrapperStruct0.var_1_15 <= WrapperStruct0.var_1_15) ? (((WrapperStruct0.var_1_12 + WrapperStruct0.var_1_12) >= (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_1 == ((double) ((((WrapperStruct0.var_1_8) < 0 ) ? -(WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_8))))) : 1) : ((WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? (WrapperStruct0.var_1_9 == ((signed char) ((((WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) < 0 ) ? -(WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) : (WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11))))) : 1) : (WrapperStruct0.var_1_9 == ((signed char) WrapperStruct0.var_1_10)))) && (((! WrapperStruct0.var_1_13) || WrapperStruct0.var_1_14) ? ((! WrapperStruct0.var_1_14) ? (WrapperStruct0.var_1_12 == ((signed long int) (((((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))) < 0 ) ? -((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))) : ((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))))))) : (WrapperStruct0.var_1_12 == ((signed long int) WrapperStruct0.var_1_9))) : 1)) && (WrapperStruct0.var_1_15 == ((double) WrapperStruct0.var_1_8)) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] EXPR ((((WrapperStruct0.var_1_15 <= WrapperStruct0.var_1_15) ? (((WrapperStruct0.var_1_12 + WrapperStruct0.var_1_12) >= (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_1 == ((double) ((((WrapperStruct0.var_1_8) < 0 ) ? -(WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_8))))) : 1) : ((WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? (WrapperStruct0.var_1_9 == ((signed char) ((((WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) < 0 ) ? -(WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) : (WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11))))) : 1) : (WrapperStruct0.var_1_9 == ((signed char) WrapperStruct0.var_1_10)))) && (((! WrapperStruct0.var_1_13) || WrapperStruct0.var_1_14) ? ((! WrapperStruct0.var_1_14) ? (WrapperStruct0.var_1_12 == ((signed long int) (((((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))) < 0 ) ? -((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))) : ((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))))))) : (WrapperStruct0.var_1_12 == ((signed long int) WrapperStruct0.var_1_9))) : 1)) && (WrapperStruct0.var_1_15 == ((double) WrapperStruct0.var_1_8)) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95-L96] return ((((WrapperStruct0.var_1_15 <= WrapperStruct0.var_1_15) ? (((WrapperStruct0.var_1_12 + WrapperStruct0.var_1_12) >= (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_1 == ((double) ((((WrapperStruct0.var_1_8) < 0 ) ? -(WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_8))))) : 1) : ((WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? (WrapperStruct0.var_1_9 == ((signed char) ((((WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) < 0 ) ? -(WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) : (WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11))))) : 1) : (WrapperStruct0.var_1_9 == ((signed char) WrapperStruct0.var_1_10)))) && (((! WrapperStruct0.var_1_13) || WrapperStruct0.var_1_14) ? ((! WrapperStruct0.var_1_14) ? (WrapperStruct0.var_1_12 == ((signed long int) (((((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))) < 0 ) ? -((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))) : ((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))))))) : (WrapperStruct0.var_1_12 == ((signed long int) WrapperStruct0.var_1_9))) : 1)) && (WrapperStruct0.var_1_15 == ((double) WrapperStruct0.var_1_8)) ; [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L19] reach_error() VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 5, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 1287 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 758 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 49 IncrementalHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 529 mSDtfsCounter, 49 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 270 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=4, InterpolantAutomatonStates: 14, 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, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 672 NumberOfCodeBlocks, 672 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 581 ConstructedInterpolants, 0 QuantifiedInterpolants, 615 SizeOfPredicates, 0 NumberOfNonLiveVariables, 863 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 974/1008 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 01:07:33,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-47.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 2b982617b4eafec7cbb1a277d4cd75e5591003436ed1218fbd6f7cc65704fea2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:07:35,677 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:07:35,759 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 01:07:35,766 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:07:35,767 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:07:35,803 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:07:35,804 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:07:35,804 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:07:35,805 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:07:35,805 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:07:35,809 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:07:35,809 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:07:35,810 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:07:35,811 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:07:35,811 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:07:35,811 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:07:35,812 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:07:35,812 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:07:35,814 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:07:35,814 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:07:35,815 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:07:35,815 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:07:35,815 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:07:35,816 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 01:07:35,816 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 01:07:35,816 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:07:35,816 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 01:07:35,817 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:07:35,817 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:07:35,817 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:07:35,818 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:07:35,818 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:07:35,818 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:07:35,818 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:07:35,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:07:35,819 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:07:35,819 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:07:35,820 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:07:35,820 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 01:07:35,820 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 01:07:35,820 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:07:35,821 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:07:35,821 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:07:35,821 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:07:35,821 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 -> 2b982617b4eafec7cbb1a277d4cd75e5591003436ed1218fbd6f7cc65704fea2 [2024-11-19 01:07:36,130 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:07:36,150 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:07:36,154 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:07:36,155 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:07:36,155 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:07:36,156 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-47.i [2024-11-19 01:07:37,553 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:07:37,770 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:07:37,770 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-47.i [2024-11-19 01:07:37,787 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b41acb2b2/a928a5ff83624bb286e86ee1fe8e290c/FLAGad6051ec5 [2024-11-19 01:07:37,807 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b41acb2b2/a928a5ff83624bb286e86ee1fe8e290c [2024-11-19 01:07:37,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:07:37,811 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:07:37,813 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:07:37,813 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:07:37,819 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:07:37,820 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:07:37" (1/1) ... [2024-11-19 01:07:37,821 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fdf215b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:37, skipping insertion in model container [2024-11-19 01:07:37,821 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:07:37" (1/1) ... [2024-11-19 01:07:37,848 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:07:38,039 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-47.i[916,929] [2024-11-19 01:07:38,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:07:38,122 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:07:38,134 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-47.i[916,929] [2024-11-19 01:07:38,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:07:38,214 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:07:38,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:38 WrapperNode [2024-11-19 01:07:38,215 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:07:38,215 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:07:38,216 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:07:38,216 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:07:38,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:38" (1/1) ... [2024-11-19 01:07:38,247 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:38" (1/1) ... [2024-11-19 01:07:38,296 INFO L138 Inliner]: procedures = 33, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 449 [2024-11-19 01:07:38,297 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:07:38,298 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:07:38,298 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:07:38,298 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:07:38,309 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:38" (1/1) ... [2024-11-19 01:07:38,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:38" (1/1) ... [2024-11-19 01:07:38,318 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:38" (1/1) ... [2024-11-19 01:07:38,349 INFO L175 MemorySlicer]: Split 115 memory accesses to 2 slices as follows [2, 113]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 12 writes are split as follows [0, 12]. [2024-11-19 01:07:38,349 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:38" (1/1) ... [2024-11-19 01:07:38,349 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:38" (1/1) ... [2024-11-19 01:07:38,385 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:38" (1/1) ... [2024-11-19 01:07:38,389 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:38" (1/1) ... [2024-11-19 01:07:38,396 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:38" (1/1) ... [2024-11-19 01:07:38,400 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:38" (1/1) ... [2024-11-19 01:07:38,406 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:07:38,407 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:07:38,407 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:07:38,407 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:07:38,408 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:38" (1/1) ... [2024-11-19 01:07:38,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:07:38,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:07:38,448 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 01:07:38,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 01:07:38,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:07:38,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-19 01:07:38,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-19 01:07:38,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-19 01:07:38,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-19 01:07:38,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 01:07:38,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 01:07:38,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 01:07:38,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 01:07:38,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-19 01:07:38,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-19 01:07:38,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-19 01:07:38,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-19 01:07:38,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 01:07:38,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 01:07:38,492 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:07:38,492 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:07:38,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:07:38,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:07:38,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 01:07:38,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 01:07:38,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 01:07:38,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 01:07:38,603 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:07:38,606 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:07:39,249 INFO L? ?]: Removed 132 outVars from TransFormulas that were not future-live. [2024-11-19 01:07:39,253 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:07:39,272 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:07:39,273 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:07:39,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:07:39 BoogieIcfgContainer [2024-11-19 01:07:39,274 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:07:39,277 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:07:39,277 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:07:39,281 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:07:39,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:07:37" (1/3) ... [2024-11-19 01:07:39,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a7062d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:07:39, skipping insertion in model container [2024-11-19 01:07:39,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:38" (2/3) ... [2024-11-19 01:07:39,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a7062d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:07:39, skipping insertion in model container [2024-11-19 01:07:39,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:07:39" (3/3) ... [2024-11-19 01:07:39,285 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-47.i [2024-11-19 01:07:39,300 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:07:39,300 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:07:39,363 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:07:39,370 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;@a43629d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:07:39,371 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:07:39,375 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 01:07:39,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 01:07:39,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:07:39,388 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:07:39,388 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:07:39,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:07:39,395 INFO L85 PathProgramCache]: Analyzing trace with hash -766083450, now seen corresponding path program 1 times [2024-11-19 01:07:39,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:07:39,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1370231389] [2024-11-19 01:07:39,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:39,411 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:07:39,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:07:39,425 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:07:39,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 01:07:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:39,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:07:39,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:07:39,753 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-19 01:07:39,753 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:07:39,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:07:39,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1370231389] [2024-11-19 01:07:39,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1370231389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:07:39,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:07:39,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 01:07:39,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578812220] [2024-11-19 01:07:39,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:07:39,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:07:39,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:07:39,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:07:39,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:07:39,791 INFO L87 Difference]: Start difference. First operand has 96 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-19 01:07:39,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:07:39,824 INFO L93 Difference]: Finished difference Result 185 states and 285 transitions. [2024-11-19 01:07:39,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:07:39,826 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2024-11-19 01:07:39,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:07:39,835 INFO L225 Difference]: With dead ends: 185 [2024-11-19 01:07:39,835 INFO L226 Difference]: Without dead ends: 92 [2024-11-19 01:07:39,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:07:39,843 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:07:39,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:07:39,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-19 01:07:39,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-19 01:07:39,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 81 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 01:07:39,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-11-19 01:07:39,894 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 84 [2024-11-19 01:07:39,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:07:39,895 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-11-19 01:07:39,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-19 01:07:39,896 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-11-19 01:07:39,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 01:07:39,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:07:39,900 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:07:39,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 01:07:40,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:07:40,106 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:07:40,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:07:40,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1428001612, now seen corresponding path program 1 times [2024-11-19 01:07:40,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:07:40,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2075005822] [2024-11-19 01:07:40,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:40,110 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:07:40,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:07:40,113 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:07:40,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 01:07:40,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:40,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 01:07:40,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:07:40,423 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 01:07:40,423 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:07:40,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:07:40,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2075005822] [2024-11-19 01:07:40,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2075005822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:07:40,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:07:40,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:07:40,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983278314] [2024-11-19 01:07:40,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:07:40,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:07:40,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:07:40,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:07:40,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:07:40,428 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 01:07:40,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:07:40,461 INFO L93 Difference]: Finished difference Result 182 states and 267 transitions. [2024-11-19 01:07:40,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:07:40,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-19 01:07:40,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:07:40,464 INFO L225 Difference]: With dead ends: 182 [2024-11-19 01:07:40,464 INFO L226 Difference]: Without dead ends: 93 [2024-11-19 01:07:40,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:07:40,466 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:07:40,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 260 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:07:40,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-19 01:07:40,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-19 01:07:40,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.4268292682926829) internal successors, (117), 82 states have internal predecessors, (117), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 01:07:40,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2024-11-19 01:07:40,477 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 84 [2024-11-19 01:07:40,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:07:40,479 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2024-11-19 01:07:40,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 01:07:40,479 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2024-11-19 01:07:40,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 01:07:40,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:07:40,482 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:07:40,491 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-11-19 01:07:40,682 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-11-19 01:07:40,683 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:07:40,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:07:40,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1178021942, now seen corresponding path program 1 times [2024-11-19 01:07:40,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:07:40,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [148477857] [2024-11-19 01:07:40,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:40,686 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:07:40,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:07:40,689 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-11-19 01:07:40,690 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-11-19 01:07:40,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:40,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 01:07:40,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:07:40,980 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 01:07:40,981 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:07:40,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:07:40,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [148477857] [2024-11-19 01:07:40,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [148477857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:07:40,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:07:40,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:07:40,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887055900] [2024-11-19 01:07:40,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:07:40,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:07:40,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:07:40,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:07:40,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:07:40,988 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 01:07:41,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:07:41,050 INFO L93 Difference]: Finished difference Result 186 states and 271 transitions. [2024-11-19 01:07:41,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:07:41,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-19 01:07:41,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:07:41,058 INFO L225 Difference]: With dead ends: 186 [2024-11-19 01:07:41,058 INFO L226 Difference]: Without dead ends: 96 [2024-11-19 01:07:41,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:07:41,059 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:07:41,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 509 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:07:41,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-19 01:07:41,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-19 01:07:41,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 85 states have (on average 1.411764705882353) internal successors, (120), 85 states have internal predecessors, (120), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 01:07:41,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-11-19 01:07:41,068 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 84 [2024-11-19 01:07:41,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:07:41,069 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-11-19 01:07:41,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 01:07:41,069 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-11-19 01:07:41,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 01:07:41,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:07:41,071 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:07:41,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-19 01:07:41,275 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-11-19 01:07:41,276 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:07:41,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:07:41,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1605540184, now seen corresponding path program 1 times [2024-11-19 01:07:41,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:07:41,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [226645903] [2024-11-19 01:07:41,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:41,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:07:41,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:07:41,281 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:07:41,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 01:07:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:41,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 01:07:41,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:07:41,533 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 01:07:41,533 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:07:41,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:07:41,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [226645903] [2024-11-19 01:07:41,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [226645903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:07:41,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:07:41,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:07:41,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922336855] [2024-11-19 01:07:41,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:07:41,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:07:41,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:07:41,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:07:41,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:07:41,535 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 01:07:41,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:07:41,602 INFO L93 Difference]: Finished difference Result 194 states and 280 transitions. [2024-11-19 01:07:41,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:07:41,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-19 01:07:41,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:07:41,606 INFO L225 Difference]: With dead ends: 194 [2024-11-19 01:07:41,606 INFO L226 Difference]: Without dead ends: 101 [2024-11-19 01:07:41,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:07:41,608 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:07:41,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 503 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:07:41,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-19 01:07:41,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-11-19 01:07:41,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 89 states have internal predecessors, (124), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 01:07:41,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2024-11-19 01:07:41,620 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 84 [2024-11-19 01:07:41,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:07:41,623 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2024-11-19 01:07:41,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 01:07:41,624 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2024-11-19 01:07:41,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 01:07:41,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:07:41,625 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:07:41,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-19 01:07:41,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:07:41,830 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:07:41,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:07:41,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1603693142, now seen corresponding path program 1 times [2024-11-19 01:07:41,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:07:41,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [927486756] [2024-11-19 01:07:41,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:41,832 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:07:41,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:07:41,835 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:07:41,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 01:07:42,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:42,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 01:07:42,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:07:42,259 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-11-19 01:07:42,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:42,625 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 127 treesize of output 69 [2024-11-19 01:07:42,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:42,959 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 137 treesize of output 82 [2024-11-19 01:07:43,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:43,282 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 147 treesize of output 95 [2024-11-19 01:07:43,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:43,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 162 treesize of output 98 [2024-11-19 01:07:44,092 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:44,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 164 treesize of output 109 [2024-11-19 01:07:44,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:44,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 217 treesize of output 79 [2024-11-19 01:07:44,600 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-19 01:07:44,601 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:07:44,601 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:07:44,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [927486756] [2024-11-19 01:07:44,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [927486756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:07:44,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:07:44,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 01:07:44,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810993279] [2024-11-19 01:07:44,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:07:44,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 01:07:44,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:07:44,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 01:07:44,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-19 01:07:44,603 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-19 01:07:47,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:07:47,100 INFO L93 Difference]: Finished difference Result 366 states and 513 transitions. [2024-11-19 01:07:47,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 01:07:47,101 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 84 [2024-11-19 01:07:47,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:07:47,103 INFO L225 Difference]: With dead ends: 366 [2024-11-19 01:07:47,103 INFO L226 Difference]: Without dead ends: 269 [2024-11-19 01:07:47,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2024-11-19 01:07:47,105 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 708 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-19 01:07:47,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 446 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-19 01:07:47,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-19 01:07:47,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 155. [2024-11-19 01:07:47,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 131 states have (on average 1.3511450381679388) internal successors, (177), 131 states have internal predecessors, (177), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 01:07:47,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 213 transitions. [2024-11-19 01:07:47,137 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 213 transitions. Word has length 84 [2024-11-19 01:07:47,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:07:47,138 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 213 transitions. [2024-11-19 01:07:47,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-19 01:07:47,138 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 213 transitions. [2024-11-19 01:07:47,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 01:07:47,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:07:47,143 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:07:47,153 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 (6)] Ended with exit code 0 [2024-11-19 01:07:47,343 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-11-19 01:07:47,344 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:07:47,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:07:47,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1303975955, now seen corresponding path program 1 times [2024-11-19 01:07:47,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:07:47,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [669805154] [2024-11-19 01:07:47,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:47,345 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:07:47,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:07:47,346 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-11-19 01:07:47,347 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-11-19 01:07:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:47,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 01:07:47,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:07:47,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:47,636 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 154 treesize of output 46 [2024-11-19 01:07:47,703 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 01:07:47,703 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:07:47,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:07:47,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [669805154] [2024-11-19 01:07:47,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [669805154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:07:47,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:07:47,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:07:47,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714922900] [2024-11-19 01:07:47,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:07:47,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:07:47,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:07:47,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:07:47,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:07:47,705 INFO L87 Difference]: Start difference. First operand 155 states and 213 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 01:07:49,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 01:07:53,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 01:07:55,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:07:55,921 INFO L93 Difference]: Finished difference Result 407 states and 552 transitions. [2024-11-19 01:07:55,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:07:55,922 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-19 01:07:55,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:07:55,924 INFO L225 Difference]: With dead ends: 407 [2024-11-19 01:07:55,924 INFO L226 Difference]: Without dead ends: 255 [2024-11-19 01:07:55,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:07:55,926 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 85 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:07:55,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 301 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 225 Invalid, 1 Unknown, 0 Unchecked, 8.1s Time] [2024-11-19 01:07:55,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-19 01:07:55,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 251. [2024-11-19 01:07:55,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 208 states have (on average 1.3173076923076923) internal successors, (274), 210 states have internal predecessors, (274), 32 states have call successors, (32), 10 states have call predecessors, (32), 10 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-19 01:07:55,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 338 transitions. [2024-11-19 01:07:55,962 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 338 transitions. Word has length 84 [2024-11-19 01:07:55,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:07:55,962 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 338 transitions. [2024-11-19 01:07:55,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 01:07:55,963 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 338 transitions. [2024-11-19 01:07:55,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 01:07:55,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:07:55,966 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:07:55,973 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 (7)] Ended with exit code 0 [2024-11-19 01:07:56,166 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-11-19 01:07:56,167 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:07:56,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:07:56,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1363453396, now seen corresponding path program 1 times [2024-11-19 01:07:56,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:07:56,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1766323691] [2024-11-19 01:07:56,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:56,168 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:07:56,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:07:56,169 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-11-19 01:07:56,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 (8)] Waiting until timeout for monitored process [2024-11-19 01:07:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:56,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 01:07:56,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:07:56,371 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 01:07:56,372 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:07:56,372 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:07:56,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1766323691] [2024-11-19 01:07:56,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1766323691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:07:56,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:07:56,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:07:56,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671365578] [2024-11-19 01:07:56,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:07:56,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:07:56,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:07:56,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:07:56,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:07:56,375 INFO L87 Difference]: Start difference. First operand 251 states and 338 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 01:07:56,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:07:56,431 INFO L93 Difference]: Finished difference Result 499 states and 673 transitions. [2024-11-19 01:07:56,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:07:56,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-19 01:07:56,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:07:56,437 INFO L225 Difference]: With dead ends: 499 [2024-11-19 01:07:56,437 INFO L226 Difference]: Without dead ends: 251 [2024-11-19 01:07:56,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:07:56,438 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:07:56,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 389 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:07:56,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-19 01:07:56,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2024-11-19 01:07:56,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 208 states have (on average 1.3076923076923077) internal successors, (272), 210 states have internal predecessors, (272), 32 states have call successors, (32), 10 states have call predecessors, (32), 10 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-19 01:07:56,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 336 transitions. [2024-11-19 01:07:56,467 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 336 transitions. Word has length 84 [2024-11-19 01:07:56,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:07:56,468 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 336 transitions. [2024-11-19 01:07:56,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 01:07:56,468 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 336 transitions. [2024-11-19 01:07:56,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-19 01:07:56,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:07:56,469 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:07:56,479 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-11-19 01:07:56,669 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-11-19 01:07:56,670 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:07:56,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:07:56,670 INFO L85 PathProgramCache]: Analyzing trace with hash -760820634, now seen corresponding path program 1 times [2024-11-19 01:07:56,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:07:56,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2090738088] [2024-11-19 01:07:56,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:56,671 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:07:56,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:07:56,674 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-11-19 01:07:56,675 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-11-19 01:07:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:56,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 01:07:56,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:07:56,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:56,962 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 66 treesize of output 24 [2024-11-19 01:07:57,007 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 01:07:57,007 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:07:57,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:07:57,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2090738088] [2024-11-19 01:07:57,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2090738088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:07:57,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:07:57,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:07:57,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425756594] [2024-11-19 01:07:57,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:07:57,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:07:57,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:07:57,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:07:57,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:07:57,009 INFO L87 Difference]: Start difference. First operand 251 states and 336 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 01:07:58,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:07:58,071 INFO L93 Difference]: Finished difference Result 735 states and 986 transitions. [2024-11-19 01:07:58,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:07:58,072 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 86 [2024-11-19 01:07:58,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:07:58,075 INFO L225 Difference]: With dead ends: 735 [2024-11-19 01:07:58,075 INFO L226 Difference]: Without dead ends: 487 [2024-11-19 01:07:58,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:07:58,077 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 112 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 01:07:58,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 319 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 01:07:58,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2024-11-19 01:07:58,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 463. [2024-11-19 01:07:58,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 378 states have (on average 1.2883597883597884) internal successors, (487), 382 states have internal predecessors, (487), 64 states have call successors, (64), 20 states have call predecessors, (64), 20 states have return successors, (64), 60 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-19 01:07:58,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 615 transitions. [2024-11-19 01:07:58,133 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 615 transitions. Word has length 86 [2024-11-19 01:07:58,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:07:58,134 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 615 transitions. [2024-11-19 01:07:58,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 01:07:58,134 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 615 transitions. [2024-11-19 01:07:58,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-19 01:07:58,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:07:58,135 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:07:58,145 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 (9)] Ended with exit code 0 [2024-11-19 01:07:58,336 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-11-19 01:07:58,336 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:07:58,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:07:58,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1522767668, now seen corresponding path program 1 times [2024-11-19 01:07:58,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:07:58,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2016694530] [2024-11-19 01:07:58,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:58,337 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:07:58,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:07:58,339 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-11-19 01:07:58,340 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-11-19 01:07:58,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:58,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 01:07:58,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:07:58,541 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-11-19 01:07:58,694 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 37 treesize of output 30 [2024-11-19 01:07:58,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:58,866 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 52 treesize of output 33 [2024-11-19 01:07:58,990 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:58,990 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 52 treesize of output 33 [2024-11-19 01:07:59,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:59,133 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 54 treesize of output 44 [2024-11-19 01:07:59,256 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:59,257 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 75 treesize of output 57 [2024-11-19 01:08:01,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:01,491 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 108 treesize of output 48 [2024-11-19 01:08:01,563 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 47 proven. 36 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-19 01:08:01,564 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:08:01,725 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 01:08:01,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:08:01,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2016694530] [2024-11-19 01:08:01,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2016694530] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 01:08:01,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:08:01,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [16] total 18 [2024-11-19 01:08:01,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563359787] [2024-11-19 01:08:01,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:08:01,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:08:01,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:08:01,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:08:01,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=254, Unknown=1, NotChecked=0, Total=306 [2024-11-19 01:08:01,727 INFO L87 Difference]: Start difference. First operand 463 states and 615 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 01:08:02,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:08:02,600 INFO L93 Difference]: Finished difference Result 1147 states and 1527 transitions. [2024-11-19 01:08:02,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:08:02,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 86 [2024-11-19 01:08:02,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:08:02,607 INFO L225 Difference]: With dead ends: 1147 [2024-11-19 01:08:02,607 INFO L226 Difference]: Without dead ends: 687 [2024-11-19 01:08:02,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=63, Invalid=356, Unknown=1, NotChecked=0, Total=420 [2024-11-19 01:08:02,609 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 86 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 01:08:02,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 397 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 01:08:02,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2024-11-19 01:08:02,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 664. [2024-11-19 01:08:02,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 573 states have (on average 1.3193717277486912) internal successors, (756), 580 states have internal predecessors, (756), 67 states have call successors, (67), 23 states have call predecessors, (67), 23 states have return successors, (67), 60 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-19 01:08:02,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 890 transitions. [2024-11-19 01:08:02,678 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 890 transitions. Word has length 86 [2024-11-19 01:08:02,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:08:02,679 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 890 transitions. [2024-11-19 01:08:02,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 01:08:02,679 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 890 transitions. [2024-11-19 01:08:02,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-19 01:08:02,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:02,681 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:08:02,692 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 (10)] Ended with exit code 0 [2024-11-19 01:08:02,882 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-11-19 01:08:02,883 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:02,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:02,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1963105168, now seen corresponding path program 1 times [2024-11-19 01:08:02,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:08:02,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [251577395] [2024-11-19 01:08:02,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:02,884 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:08:02,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:08:02,887 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-11-19 01:08:02,888 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-11-19 01:08:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:03,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-19 01:08:03,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:08:03,142 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-11-19 01:08:03,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:03,497 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 125 treesize of output 67 [2024-11-19 01:08:03,686 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:03,686 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 140 treesize of output 70 [2024-11-19 01:08:03,837 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:03,837 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 140 treesize of output 70 [2024-11-19 01:08:03,993 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:03,994 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 140 treesize of output 70 [2024-11-19 01:08:04,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:04,199 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 142 treesize of output 81 [2024-11-19 01:08:04,326 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:04,326 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 195 treesize of output 69 [2024-11-19 01:08:04,394 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-19 01:08:04,394 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:08:04,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:08:04,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [251577395] [2024-11-19 01:08:04,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [251577395] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:08:04,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [776610039] [2024-11-19 01:08:04,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:04,563 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 01:08:04,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 01:08:04,565 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 01:08:04,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-11-19 01:08:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:05,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-19 01:08:05,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:08:05,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2024-11-19 01:08:10,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:10,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 65 [2024-11-19 01:08:10,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:10,640 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 3 case distinctions, treesize of input 97 treesize of output 82 [2024-11-19 01:08:11,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:11,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 93 [2024-11-19 01:08:11,514 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:11,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 116 treesize of output 96 [2024-11-19 01:08:11,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:11,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 118 treesize of output 105 [2024-11-19 01:08:12,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:12,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 156 treesize of output 88 [2024-11-19 01:08:20,249 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 88 proven. 24 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-19 01:08:20,250 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:08:20,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [776610039] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:08:20,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 01:08:20,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 26 [2024-11-19 01:08:20,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737998237] [2024-11-19 01:08:20,381 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 01:08:20,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-19 01:08:20,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:08:20,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-19 01:08:20,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=673, Unknown=3, NotChecked=0, Total=812 [2024-11-19 01:08:20,383 INFO L87 Difference]: Start difference. First operand 664 states and 890 transitions. Second operand has 27 states, 25 states have (on average 3.4) internal successors, (85), 22 states have internal predecessors, (85), 6 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-19 01:08:25,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:08:25,574 INFO L93 Difference]: Finished difference Result 1697 states and 2249 transitions. [2024-11-19 01:08:25,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 01:08:25,575 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 3.4) internal successors, (85), 22 states have internal predecessors, (85), 6 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 86 [2024-11-19 01:08:25,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:08:25,584 INFO L225 Difference]: With dead ends: 1697 [2024-11-19 01:08:25,585 INFO L226 Difference]: Without dead ends: 1036 [2024-11-19 01:08:25,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 189 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=463, Invalid=1790, Unknown=3, NotChecked=0, Total=2256 [2024-11-19 01:08:25,588 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 1097 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1097 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-19 01:08:25,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1097 Valid, 689 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-19 01:08:25,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2024-11-19 01:08:25,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 668. [2024-11-19 01:08:25,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 577 states have (on average 1.317157712305026) internal successors, (760), 584 states have internal predecessors, (760), 67 states have call successors, (67), 23 states have call predecessors, (67), 23 states have return successors, (67), 60 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-19 01:08:25,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 894 transitions. [2024-11-19 01:08:25,670 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 894 transitions. Word has length 86 [2024-11-19 01:08:25,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:08:25,671 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 894 transitions. [2024-11-19 01:08:25,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 3.4) internal successors, (85), 22 states have internal predecessors, (85), 6 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-19 01:08:25,672 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 894 transitions. [2024-11-19 01:08:25,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-19 01:08:25,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:25,673 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:08:25,686 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 (11)] Ended with exit code 0 [2024-11-19 01:08:25,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2024-11-19 01:08:26,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-19 01:08:26,074 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:26,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:26,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1124071506, now seen corresponding path program 1 times [2024-11-19 01:08:26,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:08:26,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1648585833] [2024-11-19 01:08:26,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:26,075 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:08:26,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:08:26,076 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:08:26,077 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 (13)] Waiting until timeout for monitored process [2024-11-19 01:08:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:26,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 01:08:26,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:08:26,263 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-19 01:08:26,263 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:08:26,263 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:08:26,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1648585833] [2024-11-19 01:08:26,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1648585833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:08:26,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:08:26,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:08:26,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386710831] [2024-11-19 01:08:26,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:08:26,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:08:26,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:08:26,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:08:26,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:08:26,266 INFO L87 Difference]: Start difference. First operand 668 states and 894 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-19 01:08:26,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:08:26,405 INFO L93 Difference]: Finished difference Result 1016 states and 1344 transitions. [2024-11-19 01:08:26,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:08:26,406 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 86 [2024-11-19 01:08:26,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:08:26,408 INFO L225 Difference]: With dead ends: 1016 [2024-11-19 01:08:26,408 INFO L226 Difference]: Without dead ends: 327 [2024-11-19 01:08:26,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:08:26,411 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 1 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:08:26,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 553 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:08:26,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-11-19 01:08:26,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 247. [2024-11-19 01:08:26,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 218 states have (on average 1.2889908256880733) internal successors, (281), 218 states have internal predecessors, (281), 18 states have call successors, (18), 10 states have call predecessors, (18), 10 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 01:08:26,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 317 transitions. [2024-11-19 01:08:26,442 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 317 transitions. Word has length 86 [2024-11-19 01:08:26,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:08:26,442 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 317 transitions. [2024-11-19 01:08:26,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-19 01:08:26,443 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 317 transitions. [2024-11-19 01:08:26,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-19 01:08:26,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:26,444 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:08:26,454 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 (13)] Forceful destruction successful, exit code 0 [2024-11-19 01:08:26,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:08:26,644 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:26,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:26,645 INFO L85 PathProgramCache]: Analyzing trace with hash -513934107, now seen corresponding path program 1 times [2024-11-19 01:08:26,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:08:26,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [411139352] [2024-11-19 01:08:26,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:26,645 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:08:26,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:08:26,649 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:08:26,649 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 (14)] Waiting until timeout for monitored process [2024-11-19 01:08:26,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:26,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 01:08:26,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:08:26,955 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 01:08:26,955 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:08:26,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:08:26,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [411139352] [2024-11-19 01:08:26,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [411139352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:08:26,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:08:26,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:08:26,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849003875] [2024-11-19 01:08:26,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:08:26,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:08:26,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:08:26,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:08:26,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:08:26,957 INFO L87 Difference]: Start difference. First operand 247 states and 317 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 01:08:27,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:08:27,441 INFO L93 Difference]: Finished difference Result 747 states and 956 transitions. [2024-11-19 01:08:27,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:08:27,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 87 [2024-11-19 01:08:27,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:08:27,445 INFO L225 Difference]: With dead ends: 747 [2024-11-19 01:08:27,445 INFO L226 Difference]: Without dead ends: 503 [2024-11-19 01:08:27,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:08:27,447 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 209 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 01:08:27,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 248 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 01:08:27,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2024-11-19 01:08:27,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 377. [2024-11-19 01:08:27,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 334 states have (on average 1.2724550898203593) internal successors, (425), 334 states have internal predecessors, (425), 27 states have call successors, (27), 15 states have call predecessors, (27), 15 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-19 01:08:27,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 479 transitions. [2024-11-19 01:08:27,496 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 479 transitions. Word has length 87 [2024-11-19 01:08:27,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:08:27,497 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 479 transitions. [2024-11-19 01:08:27,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 01:08:27,497 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 479 transitions. [2024-11-19 01:08:27,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-19 01:08:27,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:27,498 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:08:27,506 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 (14)] Ended with exit code 0 [2024-11-19 01:08:27,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:08:27,698 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:27,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:27,699 INFO L85 PathProgramCache]: Analyzing trace with hash 561473697, now seen corresponding path program 1 times [2024-11-19 01:08:27,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:08:27,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [522673120] [2024-11-19 01:08:27,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:27,699 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:08:27,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:08:27,700 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:08:27,701 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 (15)] Waiting until timeout for monitored process [2024-11-19 01:08:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:27,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-19 01:08:27,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:08:28,005 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-11-19 01:08:28,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:28,366 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 132 treesize of output 59 [2024-11-19 01:08:28,548 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:28,548 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 127 treesize of output 69 [2024-11-19 01:08:28,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:28,977 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 137 treesize of output 82 [2024-11-19 01:08:29,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:29,370 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 152 treesize of output 85 [2024-11-19 01:08:29,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:29,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 154 treesize of output 105 [2024-11-19 01:08:29,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:29,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 175 treesize of output 118 [2024-11-19 01:08:33,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:33,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 236 treesize of output 161 [2024-11-19 01:08:34,221 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:34,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 386 treesize of output 136 [2024-11-19 01:08:34,503 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-19 01:08:34,503 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:08:34,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:08:34,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [522673120] [2024-11-19 01:08:34,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [522673120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:08:34,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:08:34,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-19 01:08:34,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112092859] [2024-11-19 01:08:34,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:08:34,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-19 01:08:34,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:08:34,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-19 01:08:34,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=263, Unknown=1, NotChecked=0, Total=342 [2024-11-19 01:08:34,505 INFO L87 Difference]: Start difference. First operand 377 states and 479 transitions. Second operand has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-19 01:08:39,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.97s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 01:08:42,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 01:08:45,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 01:08:49,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 01:08:52,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 01:08:55,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]